Base | Representation |
---|---|
bin | 1001011001011001101101… |
… | …1100001110010101010100 |
3 | 1100120201201010201210211110 |
4 | 2112112123130032111110 |
5 | 2323234421034322400 |
6 | 33550242431335020 |
7 | 2114314460531412 |
oct | 226263334162524 |
9 | 40521633653743 |
10 | 10332004214100 |
11 | 332386202a038 |
12 | 11aa4b3381470 |
13 | 59c3c464070a |
14 | 27a1009502b2 |
15 | 12db5c171e50 |
hex | 9659b70e554 |
10332004214100 has 36 divisors (see below), whose sum is σ = 29893932193664. Its totient is φ = 2755201123680.
The previous prime is 10332004214071. The next prime is 10332004214111. The reversal of 10332004214100 is 141240023301.
10332004214100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103320042141002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17220006724 + ... + 17220007323.
Almost surely, 210332004214100 is an apocalyptic number.
10332004214100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10332004214100 is an abundant number, since it is smaller than the sum of its proper divisors (19561927979564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10332004214100 is a wasteful number, since it uses less digits than its factorization.
10332004214100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34440014064 (or 34440014057 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10332004214100 its reverse (141240023301), we get a palindrome (10473244237401).
The spelling of 10332004214100 in words is "ten trillion, three hundred thirty-two billion, four million, two hundred fourteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •