Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …100110111001011110010000 |
3 | 111010210010022200010001000220 |
4 | 112302013131212321132100 |
5 | 101113143132030310000 |
6 | 553035413012513040 |
7 | 30051166303060644 |
oct | 2662073546713620 |
9 | 433703280101026 |
10 | 100201010010000 |
11 | 29a22011a08889 |
12 | b2a376361b780 |
13 | 43babb7798573 |
14 | 1aa5a7d0c8c24 |
15 | b8b6d17511a0 |
hex | 5b21dd9b9790 |
100201010010000 has 100 divisors (see below), whose sum is σ = 323462220543792. Its totient is φ = 26720269328000.
The previous prime is 100201010009963. The next prime is 100201010010151. The reversal of 100201010010000 is 10010102001.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1669986834 + ... + 1670046833.
Almost surely, 2100201010010000 is an apocalyptic number.
100201010010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100201010010000 is an abundant number, since it is smaller than the sum of its proper divisors (223261210533792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201010010000 is an equidigital number, since it uses as much as digits as its factorization.
100201010010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3340033698 (or 3340033677 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 100201010010000 its reverse (10010102001), we get a palindrome (100211020112001).
The spelling of 100201010010000 in words is "one hundred trillion, two hundred one billion, ten million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •