Base | Representation |
---|---|
bin | 1101110001111100010011… |
… | …00000010001101110110101 |
3 | 10222021222010011102210021102 |
4 | 12320332021200101232311 |
5 | 12432442130102304414 |
6 | 144241051104455445 |
7 | 6245225024225561 |
oct | 670761140215665 |
9 | 128258104383242 |
10 | 30303301213109 |
11 | 9723615590651 |
12 | 3494b9631a585 |
13 | 13ba7871863a2 |
14 | 76a98ab026a1 |
15 | 3783d21c9ede |
hex | 1b8f89811bb5 |
30303301213109 has 2 divisors, whose sum is σ = 30303301213110. Its totient is φ = 30303301213108.
The previous prime is 30303301213099. The next prime is 30303301213231. The reversal of 30303301213109 is 90131210330303.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22321986898225 + 7981314314884 = 4724615^2 + 2825122^2 .
It is a cyclic number.
It is not a de Polignac number, because 30303301213109 - 216 = 30303301147573 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30303301233109) 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, 15151650606554 + 15151650606555.
It is an arithmetic number, because the mean of its divisors is an integer number (15151650606555).
Almost surely, 230303301213109 is an apocalyptic number.
It is an amenable number.
30303301213109 is a deficient number, since it is larger than the sum of its proper divisors (1).
30303301213109 is an equidigital number, since it uses as much as digits as its factorization.
30303301213109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 29.
The spelling of 30303301213109 in words is "thirty trillion, three hundred three billion, three hundred one million, two hundred thirteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •