Base | Representation |
---|---|
bin | 101111111110101000001111… |
… | …111001100100011001010010 |
3 | 1000200010112212210020001101210 |
4 | 233332220033321210121102 |
5 | 210124210044030031002 |
6 | 2024441325033040550 |
7 | 62306054214033216 |
oct | 5776501771443122 |
9 | 1020115783201353 |
10 | 211012010002002 |
11 | 61264766635550 |
12 | 1b7bb65b256156 |
13 | 909846893a1a1 |
14 | 3a1707025c946 |
15 | 195dd8ece296c |
hex | bfea0fe64652 |
211012010002002 has 64 divisors (see below), whose sum is σ = 464987727646848. Its totient is φ = 63304545600000.
The previous prime is 211012010001973. The next prime is 211012010002019. The reversal of 211012010002002 is 200200010210112.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 77324268 + ... + 80006664.
It is an arithmetic number, because the mean of its divisors is an integer number (7265433244482).
Almost surely, 2211012010002002 is an apocalyptic number.
211012010002002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 211012010002002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232493863823424).
211012010002002 is an abundant number, since it is smaller than the sum of its proper divisors (253975717644846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211012010002002 is a wasteful number, since it uses less digits than its factorization.
211012010002002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2694315.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 211012010002002 its reverse (200200010210112), we get a palindrome (411212020212114).
The spelling of 211012010002002 in words is "two hundred eleven trillion, twelve billion, ten million, two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •