Base | Representation |
---|---|
bin | 101111111110011111000111… |
… | …001011011010110100010000 |
3 | 1000200002121120002222211020200 |
4 | 233332133013023122310100 |
5 | 210124030001200310000 |
6 | 2024433023354535200 |
7 | 62305256134341360 |
oct | 5776370713326420 |
9 | 1020077502884220 |
10 | 211002200010000 |
11 | 612605920a9343 |
12 | 1b7b9781a37500 |
13 | 9097564418ca9 |
14 | 3a167bd43a9a0 |
15 | 195d9b8968500 |
hex | bfe7c72dad10 |
211002200010000 has 300 divisors, whose sum is σ = 843320198552832. Its totient is φ = 48229074144000.
The previous prime is 211002200009957. The next prime is 211002200010071. The reversal of 211002200010000 is 10002200112.
It is a tau number, because it is divible by the number of its divisors (300).
It is a Harshad number since it is a multiple of its sum of digits (9).
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 59 ways as a sum of consecutive naturals, for example, 166832064 + ... + 168092063.
Almost surely, 2211002200010000 is an apocalyptic number.
211002200010000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211002200010000 is an abundant number, since it is smaller than the sum of its proper divisors (632317998542832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211002200010000 is a wasteful number, since it uses less digits than its factorization.
211002200010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334924168 (or 334924144 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 211002200010000 its reverse (10002200112), we get a palindrome (211012202210112).
The spelling of 211002200010000 in words is "two hundred eleven trillion, two billion, two hundred million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •