Base | Representation |
---|---|
bin | 100001100000001100011… |
… | …011011110100001000011 |
3 | 22011002200000022211220122 |
4 | 201200030123132201003 |
5 | 300210113104001011 |
6 | 4521400030530455 |
7 | 325223261415212 |
oct | 41401433364103 |
9 | 8132600284818 |
10 | 2302311000131 |
11 | 80844a5a174a |
12 | 312253366a2b |
13 | 1391510b9c7c |
14 | 7d60a8c5079 |
15 | 3ed4d4d23db |
hex | 2180c6de843 |
2302311000131 has 2 divisors, whose sum is σ = 2302311000132. Its totient is φ = 2302311000130.
The previous prime is 2302311000113. The next prime is 2302311000323. The reversal of 2302311000131 is 1310001132032.
Together with previous prime (2302311000113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2302311000131 - 214 = 2302310983747 is a prime.
It is a super-2 number, since 2×23023110001312 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2302311000931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151155500065 + 1151155500066.
It is an arithmetic number, because the mean of its divisors is an integer number (1151155500066).
Almost surely, 22302311000131 is an apocalyptic number.
2302311000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2302311000131 is an equidigital number, since it uses as much as digits as its factorization.
2302311000131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2302311000131 its reverse (1310001132032), we get a palindrome (3612312132163).
The spelling of 2302311000131 in words is "two trillion, three hundred two billion, three hundred eleven million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •