Base | Representation |
---|---|
bin | 1101101100000111001110… |
… | …10001110010011001100011 |
3 | 10221120211010121002021011011 |
4 | 12312003213101302121203 |
5 | 12421201431304311042 |
6 | 144005044330401351 |
7 | 6224604450465025 |
oct | 666034721623143 |
9 | 127524117067134 |
10 | 30103011010147 |
11 | 9656684a27699 |
12 | 34621b9590257 |
13 | 13a49179b97aa |
14 | 760dca27c015 |
15 | 3730ad52ea17 |
hex | 1b60e7472663 |
30103011010147 has 2 divisors, whose sum is σ = 30103011010148. Its totient is φ = 30103011010146.
The previous prime is 30103011010117. The next prime is 30103011010169. The reversal of 30103011010147 is 74101011030103.
It is an a-pointer prime, because the next prime (30103011010169) can be obtained adding 30103011010147 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30103011010147 - 215 = 30103010977379 is a prime.
It is not a weakly prime, because it can be changed into another prime (30103011010117) 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, 15051505505073 + 15051505505074.
It is an arithmetic number, because the mean of its divisors is an integer number (15051505505074).
Almost surely, 230103011010147 is an apocalyptic number.
30103011010147 is a deficient number, since it is larger than the sum of its proper divisors (1).
30103011010147 is an equidigital number, since it uses as much as digits as its factorization.
30103011010147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
The spelling of 30103011010147 in words is "thirty trillion, one hundred three billion, eleven million, ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •