Base | Representation |
---|---|
bin | 1101101111001101110010… |
… | …01110001100100001000101 |
3 | 10221222000021211120222200111 |
4 | 12313212321032030201011 |
5 | 12424423241244432023 |
6 | 144130034314313021 |
7 | 6235400234261533 |
oct | 667467116144105 |
9 | 127860254528614 |
10 | 30209612499013 |
11 | 9697908769012 |
12 | 347a9aa128771 |
13 | 13b19a609245c |
14 | 76621dd61153 |
15 | 375c4c0b600d |
hex | 1b79b938c845 |
30209612499013 has 2 divisors, whose sum is σ = 30209612499014. Its totient is φ = 30209612499012.
The previous prime is 30209612498999. The next prime is 30209612499029. The reversal of 30209612499013 is 31099421690203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15803351967649 + 14406260531364 = 3975343^2 + 3795558^2 .
It is an emirp because it is prime and its reverse (31099421690203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30209612499013 - 25 = 30209612498981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30209612899013) 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, 15104806249506 + 15104806249507.
It is an arithmetic number, because the mean of its divisors is an integer number (15104806249507).
Almost surely, 230209612499013 is an apocalyptic number.
It is an amenable number.
30209612499013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30209612499013 is an equidigital number, since it uses as much as digits as its factorization.
30209612499013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 629856, while the sum is 49.
The spelling of 30209612499013 in words is "thirty trillion, two hundred nine billion, six hundred twelve million, four hundred ninety-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •