Base | Representation |
---|---|
bin | 101111101111111011100111… |
… | …001101011001110100000010 |
3 | 1000112112222220011001222000112 |
4 | 233233323213031121310002 |
5 | 210011133104031133442 |
6 | 2022345331440151322 |
7 | 62143100401612034 |
oct | 5757734715316402 |
9 | 1015488804058015 |
10 | 210002010021122 |
11 | 60a05396a08a50 |
12 | 1b677968308542 |
13 | 902414898cac7 |
14 | 39c0219a99c54 |
15 | 194297a6c4082 |
hex | befee7359d02 |
210002010021122 has 16 divisors (see below), whose sum is σ = 355489295961600. Its totient is φ = 92163891545040.
The previous prime is 210002010021107. The next prime is 210002010021197. The reversal of 210002010021122 is 221120010200012.
It is a super-2 number, since 2×2100020100211222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210002010021097 and 210002010021106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164578377122 + ... + 164578378397.
It is an arithmetic number, because the mean of its divisors is an integer number (22218080997600).
Almost surely, 2210002010021122 is an apocalyptic number.
210002010021122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210002010021122 is a deficient number, since it is larger than the sum of its proper divisors (145487285940478).
210002010021122 is a wasteful number, since it uses less digits than its factorization.
210002010021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329156755561.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 210002010021122 its reverse (221120010200012), we get a palindrome (431122020221134).
The spelling of 210002010021122 in words is "two hundred ten trillion, two billion, ten million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •