Base | Representation |
---|---|
bin | 101111110001101010011011… |
… | …100100100111001010110101 |
3 | 1000112222101000202221100000020 |
4 | 233301222123210213022311 |
5 | 210020110302012333023 |
6 | 2022520131015035353 |
7 | 62154512156021202 |
oct | 5761523344471265 |
9 | 1015871022840006 |
10 | 210121000121013 |
11 | 60a508a77a8183 |
12 | 1b696a3596bb59 |
13 | 903242c881a37 |
14 | 39c5ca6c38ca9 |
15 | 1945ae1b8ede3 |
hex | bf1a9b9272b5 |
210121000121013 has 32 divisors (see below), whose sum is σ = 288528657984000. Its totient is φ = 135959460843456.
The previous prime is 210121000120873. The next prime is 210121000121041. The reversal of 210121000121013 is 310121000121012.
It is not a de Polignac number, because 210121000121013 - 224 = 210120983343797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210121000120983 and 210121000121001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210121000122013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18139606 + ... + 27373112.
It is an arithmetic number, because the mean of its divisors is an integer number (9016520562000).
Almost surely, 2210121000121013 is an apocalyptic number.
It is an amenable number.
210121000121013 is a deficient number, since it is larger than the sum of its proper divisors (78407657862987).
210121000121013 is a wasteful number, since it uses less digits than its factorization.
210121000121013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9235201.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 210121000121013 its reverse (310121000121012), we get a palindrome (520242000242025).
Subtracting 210121000121013 from its reverse (310121000121012), we obtain a palindrome (99999999999999).
The spelling of 210121000121013 in words is "two hundred ten trillion, one hundred twenty-one billion, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •