Base | Representation |
---|---|
bin | 1001010010111101000011… |
… | …1010101000111101011001 |
3 | 1100012010210020200222200022 |
4 | 2110233100322220331121 |
5 | 2314431040422331413 |
6 | 33423322543320225 |
7 | 2103313443311213 |
oct | 224572072507531 |
9 | 40163706628608 |
10 | 10221232230233 |
11 | 3290889144032 |
12 | 1190b39bb0075 |
13 | 591b2021c92b |
14 | 2749d30155b3 |
15 | 12ad273d8608 |
hex | 94bd0ea8f59 |
10221232230233 has 2 divisors, whose sum is σ = 10221232230234. Its totient is φ = 10221232230232.
The previous prime is 10221232230193. The next prime is 10221232230277. The reversal of 10221232230233 is 33203223212201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5197501718809 + 5023730511424 = 2279803^2 + 2241368^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221232230233 is a prime.
It is not a weakly prime, because it can be changed into another prime (10221232235233) 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, 5110616115116 + 5110616115117.
It is an arithmetic number, because the mean of its divisors is an integer number (5110616115117).
Almost surely, 210221232230233 is an apocalyptic number.
It is an amenable number.
10221232230233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221232230233 is an equidigital number, since it uses as much as digits as its factorization.
10221232230233 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 26.
Adding to 10221232230233 its reverse (33203223212201), we get a palindrome (43424455442434).
The spelling of 10221232230233 in words is "ten trillion, two hundred twenty-one billion, two hundred thirty-two million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •