Base | Representation |
---|---|
bin | 100001011111001100001… |
… | …000100110011101110011 |
3 | 22010222212211120201102011 |
4 | 201133030020212131303 |
5 | 300200410432411011 |
6 | 4521101014503351 |
7 | 325154452615336 |
oct | 41371410463563 |
9 | 8128784521364 |
10 | 2301232310131 |
11 | 807a46711a07 |
12 | 311bb2064b57 |
13 | 13900b78aa71 |
14 | 7d54753261d |
15 | 3ecd895a621 |
hex | 217cc226773 |
2301232310131 has 2 divisors, whose sum is σ = 2301232310132. Its totient is φ = 2301232310130.
The previous prime is 2301232310129. The next prime is 2301232310173. The reversal of 2301232310131 is 1310132321032.
2301232310131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2301232310131 - 21 = 2301232310129 is a prime.
It is a super-2 number, since 2×23012323101312 (a number of 26 digits) contains 22 as substring.
Together with 2301232310129, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2301232380131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150616155065 + 1150616155066.
It is an arithmetic number, because the mean of its divisors is an integer number (1150616155066).
Almost surely, 22301232310131 is an apocalyptic number.
2301232310131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2301232310131 is an equidigital number, since it uses as much as digits as its factorization.
2301232310131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 2301232310131 its reverse (1310132321032), we get a palindrome (3611364631163).
The spelling of 2301232310131 in words is "two trillion, three hundred one billion, two hundred thirty-two million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •