Base | Representation |
---|---|
bin | 101111101111111011100110… |
… | …100111101001000100000001 |
3 | 1000112112222212110110001010120 |
4 | 233233323212213221010001 |
5 | 210011133044012401423 |
6 | 2022345330444050453 |
7 | 62143100221512663 |
oct | 5757734647510401 |
9 | 1015488773401116 |
10 | 210002000122113 |
11 | 60a05391367751 |
12 | 1b677964b33a29 |
13 | 90241469051c4 |
14 | 39c0218640533 |
15 | 19429798baee3 |
hex | befee69e9101 |
210002000122113 has 8 divisors (see below), whose sum is σ = 281856989126976. Its totient is φ = 139074172266000.
The previous prime is 210002000122069. The next prime is 210002000122129. The reversal of 210002000122113 is 311221000200012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210002000122113 - 26 = 210002000122049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210002000122092 and 210002000122101.
It is not an unprimeable number, because it can be changed into a prime (210002000122513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231790286658 + ... + 231790287563.
It is an arithmetic number, because the mean of its divisors is an integer number (35232123640872).
Almost surely, 2210002000122113 is an apocalyptic number.
It is an amenable number.
210002000122113 is a deficient number, since it is larger than the sum of its proper divisors (71854989004863).
210002000122113 is a wasteful number, since it uses less digits than its factorization.
210002000122113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463580574375.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 210002000122113 its reverse (311221000200012), we get a palindrome (521223000322125).
The spelling of 210002000122113 in words is "two hundred ten trillion, two billion, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •