Base | Representation |
---|---|
bin | 1101101100000101011000… |
… | …11000110111101110001101 |
3 | 10221120201120201222201102001 |
4 | 12312002230120313232031 |
5 | 12421142420342324323 |
6 | 144004402314232301 |
7 | 6224541122566456 |
oct | 666025430675615 |
9 | 127521521881361 |
10 | 30102023011213 |
11 | 965621826044a |
12 | 3461b82725691 |
13 | 13a47bb0c1c3a |
14 | 760d34d7612d |
15 | 37305191e3ad |
hex | 1b60ac637b8d |
30102023011213 has 2 divisors, whose sum is σ = 30102023011214. Its totient is φ = 30102023011212.
The previous prime is 30102023011189. The next prime is 30102023011271. The reversal of 30102023011213 is 31211032020103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23044781048004 + 7057241963209 = 4800498^2 + 2656547^2 .
It is a cyclic number.
It is not a de Polignac number, because 30102023011213 - 217 = 30102022880141 is a prime.
It is a super-2 number, since 2×301020230112132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30102023011273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051011505606 + 15051011505607.
It is an arithmetic number, because the mean of its divisors is an integer number (15051011505607).
Almost surely, 230102023011213 is an apocalyptic number.
It is an amenable number.
30102023011213 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102023011213 is an equidigital number, since it uses as much as digits as its factorization.
30102023011213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30102023011213 its reverse (31211032020103), we get a palindrome (61313055031316).
The spelling of 30102023011213 in words is "thirty trillion, one hundred two billion, twenty-three million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •