Base | Representation |
---|---|
bin | 100010001000011110000011… |
… | …0001010001100111100001111 |
3 | 1110101000211012200201210021211 |
4 | 1010100330012022030330033 |
5 | 303322442000232330111 |
6 | 2542312151002235251 |
7 | 120144663034136542 |
oct | 10420740612147417 |
9 | 1411024180653254 |
10 | 300231202230031 |
11 | 87732379713996 |
12 | 2980a99a1b5b27 |
13 | cb6a8b0bb15a7 |
14 | 541d3a68b2859 |
15 | 24a9a81238521 |
hex | 1110f0628cf0f |
300231202230031 has 2 divisors, whose sum is σ = 300231202230032. Its totient is φ = 300231202230030.
The previous prime is 300231202229977. The next prime is 300231202230059. The reversal of 300231202230031 is 130032202132003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 300231202230031 - 215 = 300231202197263 is a prime.
It is a super-2 number, since 2×3002312022300312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 300231202229984 and 300231202230011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300231202230431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150115601115015 + 150115601115016.
It is an arithmetic number, because the mean of its divisors is an integer number (150115601115016).
Almost surely, 2300231202230031 is an apocalyptic number.
300231202230031 is a deficient number, since it is larger than the sum of its proper divisors (1).
300231202230031 is an equidigital number, since it uses as much as digits as its factorization.
300231202230031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 300231202230031 its reverse (130032202132003), we get a palindrome (430263404362034).
The spelling of 300231202230031 in words is "three hundred trillion, two hundred thirty-one billion, two hundred two million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •