Base | Representation |
---|---|
bin | 11110111001100100101… |
… | …001011100011101111011 |
3 | 21111222212120021211102201 |
4 | 132321210221130131323 |
5 | 234242212010232311 |
6 | 4303251055211031 |
7 | 306260614566310 |
oct | 36714451343573 |
9 | 7458776254381 |
10 | 2123402430331 |
11 | 7495913511a6 |
12 | 2a3643216a77 |
13 | 12530b615810 |
14 | 74ab7a36d07 |
15 | 3a37ba1a9c1 |
hex | 1ee64a5c77b |
2123402430331 has 64 divisors (see below), whose sum is σ = 2871396218880. Its totient is φ = 1521993369600.
The previous prime is 2123402430323. The next prime is 2123402430337. The reversal of 2123402430331 is 1330342043212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2123402430331 - 23 = 2123402430323 is a prime.
It is a super-2 number, since 2×21234024303312 (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 2123402430331.
It is not an unprimeable number, because it can be changed into a prime (2123402430337) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 214458481 + ... + 214468381.
It is an arithmetic number, because the mean of its divisors is an integer number (44865565920).
Almost surely, 22123402430331 is an apocalyptic number.
2123402430331 is a deficient number, since it is larger than the sum of its proper divisors (747993788549).
2123402430331 is a wasteful number, since it uses less digits than its factorization.
2123402430331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15356.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 2123402430331 its reverse (1330342043212), we get a palindrome (3453744473543).
The spelling of 2123402430331 in words is "two trillion, one hundred twenty-three billion, four hundred two million, four hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •