Base | Representation |
---|---|
bin | 101111011111111000… |
… | …0111110110000000000 |
3 | 100202021122212220110200 |
4 | 1132333300332300000 |
5 | 3132344343123000 |
6 | 114505302525200 |
7 | 10240456515300 |
oct | 1367760766000 |
9 | 322248786420 |
10 | 102001536000 |
11 | 3a293231791 |
12 | 17928136800 |
13 | 98073a3c80 |
14 | 4d18bd9600 |
15 | 29bed02500 |
hex | 17bfc3ec00 |
102001536000 has 1584 divisors, whose sum is σ = 463785023520. Its totient is φ = 21366374400.
The previous prime is 102001535969. The next prime is 102001536029. The reversal of 102001536000 is 635100201.
102001536000 is a `hidden beast` number, since 10 + 2 + 0 + 0 + 1 + 53 + 600 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 733823931 + ... + 733824069.
Almost surely, 2102001536000 is an apocalyptic number.
102001536000 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 102001536000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231892511760).
102001536000 is an abundant number, since it is smaller than the sum of its proper divisors (361783487520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102001536000 is a wasteful number, since it uses less digits than its factorization.
102001536000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207 (or 169 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 102001536000 its reverse (635100201), we get a palindrome (102636636201).
The spelling of 102001536000 in words is "one hundred two billion, one million, five hundred thirty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •