Base | Representation |
---|---|
bin | 11110110111101000100… |
… | …110010010111110011000 |
3 | 21111210111112010220121120 |
4 | 132313220212102332120 |
5 | 234223431213331412 |
6 | 4302304352005240 |
7 | 306155213642451 |
oct | 36675046227630 |
9 | 7453445126546 |
10 | 2121321230232 |
11 | 748713593816 |
12 | 2a3162230820 |
13 | 1250693aaa79 |
14 | 7495b482128 |
15 | 3a2a8e68b8c |
hex | 1ede8992f98 |
2121321230232 has 16 divisors (see below), whose sum is σ = 5303303075640. Its totient is φ = 707107076736.
The previous prime is 2121321230183. The next prime is 2121321230261. The reversal of 2121321230232 is 2320321231212.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 88388384593 = 2121321230232 / (2 + 1 + 2 + 1 + 3 + 2 + 1 + 2 + 3 + 0 + 2 + 3 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44194192273 + ... + 44194192320.
Almost surely, 22121321230232 is an apocalyptic number.
It is an amenable number.
2121321230232 is an abundant number, since it is smaller than the sum of its proper divisors (3181981845408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121321230232 is a wasteful number, since it uses less digits than its factorization.
2121321230232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88388384602 (or 88388384598 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2121321230232 its reverse (2320321231212), we get a palindrome (4441642461444).
The spelling of 2121321230232 in words is "two trillion, one hundred twenty-one billion, three hundred twenty-one million, two hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •