Base | Representation |
---|---|
bin | 101111101111111010110001… |
… | …000110000010110000010000 |
3 | 1000112112220112212200220120010 |
4 | 233233322301012002300100 |
5 | 210011124224120401000 |
6 | 2022345101404514520 |
7 | 62143036035603600 |
oct | 5757726106026020 |
9 | 1015486485626503 |
10 | 210001102122000 |
11 | 60a04a704809a2 |
12 | 1b67775424ba40 |
13 | 902403285bba7 |
14 | 39c0171284c00 |
15 | 1942925b36d50 |
hex | befeb1182c10 |
210001102122000 has 240 divisors, whose sum is σ = 787581277322112. Its totient is φ = 48000251846400.
The previous prime is 210001102121981. The next prime is 210001102122013. The reversal of 210001102122000 is 221201100012.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 356850732 + ... + 357438731.
Almost surely, 2210001102122000 is an apocalyptic number.
210001102122000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210001102122000 is an abundant number, since it is smaller than the sum of its proper divisors (577580175200112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210001102122000 is a wasteful number, since it uses less digits than its factorization.
210001102122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714289503 (or 714289480 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210001102122000 its reverse (221201100012), we get a palindrome (210222303222012).
The spelling of 210001102122000 in words is "two hundred ten trillion, one billion, one hundred two million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •