Base | Representation |
---|---|
bin | 10011001111100100… |
… | …11001111100010100 |
3 | 222122222222101220012 |
4 | 21213302121330110 |
5 | 132124241420200 |
6 | 4425053255352 |
7 | 514005522260 |
oct | 114762317424 |
9 | 28588871805 |
10 | 10331201300 |
11 | 442176a4a2 |
12 | 2003a94558 |
13 | c884c0c84 |
14 | 7001390a0 |
15 | 406ed1a35 |
hex | 267c99f14 |
10331201300 has 144 divisors (see below), whose sum is σ = 26091663360. Its totient is φ = 3477651840.
The previous prime is 10331201273. The next prime is 10331201317. The reversal of 10331201300 is 310213301.
It is a super-2 number, since 2×103312013002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12552689 + ... + 12553511.
Almost surely, 210331201300 is an apocalyptic number.
10331201300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10331201300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13045831680).
10331201300 is an abundant number, since it is smaller than the sum of its proper divisors (15760462060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10331201300 is a wasteful number, since it uses less digits than its factorization.
10331201300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1150 (or 1143 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 10331201300 its reverse (310213301), we get a palindrome (10641414601).
The spelling of 10331201300 in words is "ten billion, three hundred thirty-one million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •