Base | Representation |
---|---|
bin | 1101101111000000000001… |
… | …10001111000110011110111 |
3 | 10221221022012212010210021221 |
4 | 12313200000301320303313 |
5 | 12424313123103300343 |
6 | 144122413150051211 |
7 | 6235016146404553 |
oct | 667400061706367 |
9 | 127838185123257 |
10 | 30202223103223 |
11 | 9694766631646 |
12 | 34794874a9b07 |
13 | 13b10991bb802 |
14 | 765b1c800863 |
15 | 3759684d05ed |
hex | 1b7800c78cf7 |
30202223103223 has 2 divisors, whose sum is σ = 30202223103224. Its totient is φ = 30202223103222.
The previous prime is 30202223103211. The next prime is 30202223103271. The reversal of 30202223103223 is 32230132220203.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30202223103223 is a prime.
It is a super-2 number, since 2×302022231032232 (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 (30202223103623) 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, 15101111551611 + 15101111551612.
It is an arithmetic number, because the mean of its divisors is an integer number (15101111551612).
Almost surely, 230202223103223 is an apocalyptic number.
30202223103223 is a deficient number, since it is larger than the sum of its proper divisors (1).
30202223103223 is an equidigital number, since it uses as much as digits as its factorization.
30202223103223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 30202223103223 its reverse (32230132220203), we get a palindrome (62432355323426).
The spelling of 30202223103223 in words is "thirty trillion, two hundred two billion, two hundred twenty-three million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •