Base | Representation |
---|---|
bin | 1001011001010111000110… |
… | …0110010010111010100001 |
3 | 1100120122220012210100221021 |
4 | 2112111301212102322201 |
5 | 2323232001331224413 |
6 | 33550045033125441 |
7 | 2114261204566003 |
oct | 226256146227241 |
9 | 40518805710837 |
10 | 10331302211233 |
11 | 3323531841983 |
12 | 11aa338259881 |
13 | 59c31207c7c3 |
14 | 27a075614373 |
15 | 12db1a70618d |
hex | 96571992ea1 |
10331302211233 has 2 divisors, whose sum is σ = 10331302211234. Its totient is φ = 10331302211232.
The previous prime is 10331302211149. The next prime is 10331302211239. The reversal of 10331302211233 is 33211220313301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6594685632144 + 3736616579089 = 2568012^2 + 1933033^2 .
It is a cyclic number.
It is not a de Polignac number, because 10331302211233 - 237 = 10193863257761 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10331302211198 and 10331302211207.
It is not a weakly prime, because it can be changed into another prime (10331302211239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165651105616 + 5165651105617.
It is an arithmetic number, because the mean of its divisors is an integer number (5165651105617).
Almost surely, 210331302211233 is an apocalyptic number.
It is an amenable number.
10331302211233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10331302211233 is an equidigital number, since it uses as much as digits as its factorization.
10331302211233 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 25.
Adding to 10331302211233 its reverse (33211220313301), we get a palindrome (43542522524534).
The spelling of 10331302211233 in words is "ten trillion, three hundred thirty-one billion, three hundred two million, two hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •