Base | Representation |
---|---|
bin | 1101101111010000100100… |
… | …11111111001000101001111 |
3 | 10221222011011012222200101202 |
4 | 12313220102133321011033 |
5 | 12424434323214411343 |
6 | 144130443101500115 |
7 | 6235452322412213 |
oct | 667502237710517 |
9 | 127864135880352 |
10 | 30211110310223 |
11 | 9698507193817 |
12 | 347b14787163b |
13 | 13b1b8449938b |
14 | 766322c54943 |
15 | 375cd882bdb8 |
hex | 1b7a127f914f |
30211110310223 has 2 divisors, whose sum is σ = 30211110310224. Its totient is φ = 30211110310222.
The previous prime is 30211110310193. The next prime is 30211110310231. The reversal of 30211110310223 is 32201301111203.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30211110310223 - 210 = 30211110309199 is a prime.
It is a super-2 number, since 2×302111103102232 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30211110310195 and 30211110310204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30211110910223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105555155111 + 15105555155112.
It is an arithmetic number, because the mean of its divisors is an integer number (15105555155112).
Almost surely, 230211110310223 is an apocalyptic number.
30211110310223 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211110310223 is an equidigital number, since it uses as much as digits as its factorization.
30211110310223 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 20.
Adding to 30211110310223 its reverse (32201301111203), we get a palindrome (62412411421426).
The spelling of 30211110310223 in words is "thirty trillion, two hundred eleven billion, one hundred ten million, three hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •