Base | Representation |
---|---|
bin | 100010000111100110100011… |
… | …1000000000111001111111111 |
3 | 1110100121102121110002001221022 |
4 | 1010033031013000013033333 |
5 | 303314013414420120111 |
6 | 2542141321433454355 |
7 | 120133243620436526 |
oct | 10417150700071777 |
9 | 1410542543061838 |
10 | 300112031020031 |
11 | 87696885673a8a |
12 | 297ab87bb713bb |
13 | cb5c59b61a409 |
14 | 54176dd66b4bd |
15 | 24a6908de52db |
hex | 110f3470073ff |
300112031020031 has 2 divisors, whose sum is σ = 300112031020032. Its totient is φ = 300112031020030.
The previous prime is 300112031020007. The next prime is 300112031020049. The reversal of 300112031020031 is 130020130211003.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300112031020031 is a prime.
It is a super-2 number, since 2×3001120310200312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 300112031019991 and 300112031020009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300112031022031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150056015510015 + 150056015510016.
It is an arithmetic number, because the mean of its divisors is an integer number (150056015510016).
Almost surely, 2300112031020031 is an apocalyptic number.
300112031020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
300112031020031 is an equidigital number, since it uses as much as digits as its factorization.
300112031020031 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 300112031020031 its reverse (130020130211003), we get a palindrome (430132161231034).
The spelling of 300112031020031 in words is "three hundred trillion, one hundred twelve billion, thirty-one million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •