Base | Representation |
---|---|
bin | 1101101001011101110011… |
… | …11011100101100100000101 |
3 | 10221021010100210000001121101 |
4 | 12310232321323211210011 |
5 | 12413204142302334334 |
6 | 143455203111020101 |
7 | 6215204503023004 |
oct | 664567173454405 |
9 | 127233323001541 |
10 | 30012055902469 |
11 | 9621050165013 |
12 | 344865496a631 |
13 | 1399181047954 |
14 | 75a83c59ac3b |
15 | 370a383dd214 |
hex | 1b4bb9ee5905 |
30012055902469 has 2 divisors, whose sum is σ = 30012055902470. Its totient is φ = 30012055902468.
The previous prime is 30012055902463. The next prime is 30012055902523. The reversal of 30012055902469 is 96420955021003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25293003516225 + 4719052386244 = 5029215^2 + 2172338^2 .
It is an emirp because it is prime and its reverse (96420955021003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30012055902469 - 23 = 30012055902461 is a prime.
It is a super-2 number, since 2×300120559024692 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30012055902461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15006027951234 + 15006027951235.
It is an arithmetic number, because the mean of its divisors is an integer number (15006027951235).
Almost surely, 230012055902469 is an apocalyptic number.
It is an amenable number.
30012055902469 is a deficient number, since it is larger than the sum of its proper divisors (1).
30012055902469 is an equidigital number, since it uses as much as digits as its factorization.
30012055902469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 46.
The spelling of 30012055902469 in words is "thirty trillion, twelve billion, fifty-five million, nine hundred two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •