Base | Representation |
---|---|
bin | 1101111100100110000101… |
… | …11001111001000000011011 |
3 | 11000120221220210022101001212 |
4 | 12332103002321321000123 |
5 | 13004441300112332201 |
6 | 145121144302133335 |
7 | 6313533514341056 |
oct | 676230271710033 |
9 | 130527823271055 |
10 | 30669336449051 |
11 | 9854879972003 |
12 | 3533b0a88124b |
13 | 141614bbc71b1 |
14 | 780592079a9d |
15 | 382ba6d84abb |
hex | 1be4c2e7901b |
30669336449051 has 2 divisors, whose sum is σ = 30669336449052. Its totient is φ = 30669336449050.
The previous prime is 30669336448991. The next prime is 30669336449053. The reversal of 30669336449051 is 15094463396603.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30669336449051 - 210 = 30669336448027 is a prime.
Together with 30669336449053, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30669336449053) 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, 15334668224525 + 15334668224526.
It is an arithmetic number, because the mean of its divisors is an integer number (15334668224526).
Almost surely, 230669336449051 is an apocalyptic number.
30669336449051 is a deficient number, since it is larger than the sum of its proper divisors (1).
30669336449051 is an equidigital number, since it uses as much as digits as its factorization.
30669336449051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37791360, while the sum is 59.
The spelling of 30669336449051 in words is "thirty trillion, six hundred sixty-nine billion, three hundred thirty-six million, four hundred forty-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •