Base | Representation |
---|---|
bin | 1011000000010101001010… |
… | …1100010011100111100001 |
3 | 1120211210000102110012211101 |
4 | 2300011102230103213201 |
5 | 3041222413404003413 |
6 | 41422450014114401 |
7 | 2356134652552165 |
oct | 260052254234741 |
9 | 46753012405741 |
10 | 12100310219233 |
11 | 3945792734235 |
12 | 14351554aba01 |
13 | 69a0925676b2 |
14 | 2db92dd12ca5 |
15 | 15eb544d6edd |
hex | b0152b139e1 |
12100310219233 has 2 divisors, whose sum is σ = 12100310219234. Its totient is φ = 12100310219232.
The previous prime is 12100310219219. The next prime is 12100310219243. The reversal of 12100310219233 is 33291201300121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10231886407824 + 1868423811409 = 3198732^2 + 1366903^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100310219233 - 25 = 12100310219201 is a prime.
It is not a weakly prime, because it can be changed into another prime (12100310219243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050155109616 + 6050155109617.
It is an arithmetic number, because the mean of its divisors is an integer number (6050155109617).
Almost surely, 212100310219233 is an apocalyptic number.
It is an amenable number.
12100310219233 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100310219233 is an equidigital number, since it uses as much as digits as its factorization.
12100310219233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 28.
Adding to 12100310219233 its reverse (33291201300121), we get a palindrome (45391511519354).
The spelling of 12100310219233 in words is "twelve trillion, one hundred billion, three hundred ten million, two hundred nineteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •