Base | Representation |
---|---|
bin | 1101111011010000001111… |
… | …01001010111010000101001 |
3 | 11000102112221121022110021101 |
4 | 12331220013221113100221 |
5 | 13003212401221313134 |
6 | 145044042524441401 |
7 | 6310312363355224 |
oct | 675500751272051 |
9 | 130375847273241 |
10 | 30623245104169 |
11 | 9837277573443 |
12 | 3526ba69a9261 |
13 | 14119b4b75a63 |
14 | 77c25c8c25bb |
15 | 3818aa71ee14 |
hex | 1bda07a57429 |
30623245104169 has 2 divisors, whose sum is σ = 30623245104170. Its totient is φ = 30623245104168.
The previous prime is 30623245104077. The next prime is 30623245104203. The reversal of 30623245104169 is 96140154232603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16444744364944 + 14178500739225 = 4055212^2 + 3765435^2 .
It is a cyclic number.
It is not a de Polignac number, because 30623245104169 - 227 = 30623110886441 is a prime.
It is a super-2 number, since 2×306232451041692 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30623240104169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15311622552084 + 15311622552085.
It is an arithmetic number, because the mean of its divisors is an integer number (15311622552085).
Almost surely, 230623245104169 is an apocalyptic number.
It is an amenable number.
30623245104169 is a deficient number, since it is larger than the sum of its proper divisors (1).
30623245104169 is an equidigital number, since it uses as much as digits as its factorization.
30623245104169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 30623245104169 in words is "thirty trillion, six hundred twenty-three billion, two hundred forty-five million, one hundred four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •