Base | Representation |
---|---|
bin | 1000101111101000011… |
… | …10001110001000011111 |
3 | 1001201111212220002101002 |
4 | 10113310032032020133 |
5 | 14410310212041111 |
6 | 350005212340515 |
7 | 30464301546326 |
oct | 4276416161037 |
9 | 1051455802332 |
10 | 300450112031 |
11 | 10646928a113 |
12 | 4a29017473b |
13 | 224421675a4 |
14 | 10782c2d0bd |
15 | 7c36e7063b |
hex | 45f438e21f |
300450112031 has 2 divisors, whose sum is σ = 300450112032. Its totient is φ = 300450112030.
The previous prime is 300450112019. The next prime is 300450112043. The reversal of 300450112031 is 130211054003.
It is a balanced prime because it is at equal distance from previous prime (300450112019) and next prime (300450112043).
It is a cyclic number.
It is not a de Polignac number, because 300450112031 - 26 = 300450111967 is a prime.
It is a super-2 number, since 2×3004501120312 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 300450111994 and 300450112012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300450112531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150225056015 + 150225056016.
It is an arithmetic number, because the mean of its divisors is an integer number (150225056016).
Almost surely, 2300450112031 is an apocalyptic number.
300450112031 is a deficient number, since it is larger than the sum of its proper divisors (1).
300450112031 is an equidigital number, since it uses as much as digits as its factorization.
300450112031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 300450112031 its reverse (130211054003), we get a palindrome (430661166034).
The spelling of 300450112031 in words is "three hundred billion, four hundred fifty million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •