Base | Representation |
---|---|
bin | 100001011110001111110… |
… | …011000010000101011011 |
3 | 22010220021021210012201001 |
4 | 201132033303002011123 |
5 | 300141322311220011 |
6 | 4520412334005431 |
7 | 325120411411312 |
oct | 41361763020533 |
9 | 8126237705631 |
10 | 2300220023131 |
11 | 807577266788 |
12 | 31196b046877 |
13 | 138ba9b3b084 |
14 | 7d48cd07279 |
15 | 3ec79b4d7c1 |
hex | 2178fcc215b |
2300220023131 has 2 divisors, whose sum is σ = 2300220023132. Its totient is φ = 2300220023130.
The previous prime is 2300220023119. The next prime is 2300220023141. The reversal of 2300220023131 is 1313200220032.
2300220023131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2300220023131 - 211 = 2300220021083 is a prime.
It is a super-2 number, since 2×23002200231312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2300220023099 and 2300220023108.
It is not a weakly prime, because it can be changed into another prime (2300220023141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150110011565 + 1150110011566.
It is an arithmetic number, because the mean of its divisors is an integer number (1150110011566).
Almost surely, 22300220023131 is an apocalyptic number.
2300220023131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2300220023131 is an equidigital number, since it uses as much as digits as its factorization.
2300220023131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2300220023131 its reverse (1313200220032), we get a palindrome (3613420243163).
The spelling of 2300220023131 in words is "two trillion, three hundred billion, two hundred twenty million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •