Base | Representation |
---|---|
bin | 10111001100110000000100… |
… | …001011100110000010000000 |
3 | 111101021002122122112101021010 |
4 | 113030300010023212002000 |
5 | 101333140112141411000 |
6 | 1001000312131000520 |
7 | 30330343025550015 |
oct | 2714600413460200 |
9 | 441232578471233 |
10 | 102031313232000 |
11 | 2a568267406699 |
12 | b53a428439140 |
13 | 44c1685b61059 |
14 | 1b2a4b02b370c |
15 | bbe10682bd50 |
hex | 5ccc042e6080 |
102031313232000 has 256 divisors, whose sum is σ = 340388183940480. Its totient is φ = 27035046604800.
The previous prime is 102031313231977. The next prime is 102031313232011. The reversal of 102031313232000 is 232313130201.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 766407 + ... + 14305593.
Almost surely, 2102031313232000 is an apocalyptic number.
102031313232000 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 102031313232000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170194091970240).
102031313232000 is an abundant number, since it is smaller than the sum of its proper divisors (238356870708480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102031313232000 is a wasteful number, since it uses less digits than its factorization.
102031313232000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13539376 (or 13539354 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102031313232000 its reverse (232313130201), we get a palindrome (102263626362201).
The spelling of 102031313232000 in words is "one hundred two trillion, thirty-one billion, three hundred thirteen million, two hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •