Base | Representation |
---|---|
bin | 11110110111010110101… |
… | …001001110111011110111 |
3 | 21111202201112100100110020 |
4 | 132313112221032323313 |
5 | 234222322110311411 |
6 | 4302214431500223 |
7 | 306144565422153 |
oct | 36672651167367 |
9 | 7452645310406 |
10 | 2121020010231 |
11 | 748579556771 |
12 | 2a3099387673 |
13 | 12501bb73895 |
14 | 7492d472063 |
15 | 3a28c7b8606 |
hex | 1edd6a4eef7 |
2121020010231 has 8 divisors (see below), whose sum is σ = 2830722610800. Its totient is φ = 1412665374912.
The previous prime is 2121020010203. The next prime is 2121020010253. The reversal of 2121020010231 is 1320100201212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2121020010231 - 237 = 1983581056759 is a prime.
It is a super-2 number, since 2×21210200102312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2121020010231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121020050231) 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, 336987640 + ... + 336993933.
It is an arithmetic number, because the mean of its divisors is an integer number (353840326350).
Almost surely, 22121020010231 is an apocalyptic number.
2121020010231 is a deficient number, since it is larger than the sum of its proper divisors (709702600569).
2121020010231 is a wasteful number, since it uses less digits than its factorization.
2121020010231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673982625.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2121020010231 its reverse (1320100201212), we get a palindrome (3441120211443).
The spelling of 2121020010231 in words is "two trillion, one hundred twenty-one billion, twenty million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •