Base | Representation |
---|---|
bin | 11101000111100100111… |
… | …010000110110011010100 |
3 | 21002021221010221210201100 |
4 | 131013210322012303110 |
5 | 230241022024330400 |
6 | 4131125151230100 |
7 | 264365436214554 |
oct | 35074472066324 |
9 | 7067833853640 |
10 | 2001000230100 |
11 | 70168a511533 |
12 | 283982b18330 |
13 | 1169028521c1 |
14 | 6cbc565b164 |
15 | 370b5c07100 |
hex | 1d1e4e86cd4 |
2001000230100 has 432 divisors, whose sum is σ = 6533966799360. Its totient is φ = 511776921600.
The previous prime is 2001000230029. The next prime is 2001000230179. The reversal of 2001000230100 is 10320001002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 819744880 + ... + 819747320.
Almost surely, 22001000230100 is an apocalyptic number.
2001000230100 is a gapful number since it is divisible by the number (20) 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 2001000230100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3266983399680).
2001000230100 is an abundant number, since it is smaller than the sum of its proper divisors (4532966569260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001000230100 is a wasteful number, since it uses less digits than its factorization.
2001000230100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2840 (or 2830 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 2001000230100 its reverse (10320001002), we get a palindrome (2011320231102).
The spelling of 2001000230100 in words is "two trillion, one billion, two hundred thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •