Base | Representation |
---|---|
bin | 1001011110101100110000… |
… | …0100010001011101001001 |
3 | 1100220102121210022211112111 |
4 | 2113223030010101131021 |
5 | 2331232313132112413 |
6 | 34100133334142321 |
7 | 2124016004006656 |
oct | 227531404213511 |
9 | 40812553284474 |
10 | 10423014332233 |
11 | 33594149548a8 |
12 | 12040724b19a1 |
13 | 5a7b69803419 |
14 | 280695a70c2d |
15 | 1311d702cd3d |
hex | 97acc111749 |
10423014332233 has 2 divisors, whose sum is σ = 10423014332234. Its totient is φ = 10423014332232.
The previous prime is 10423014332221. The next prime is 10423014332239. The reversal of 10423014332233 is 33223341032401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7848363029049 + 2574651303184 = 2801493^2 + 1604572^2 .
It is a cyclic number.
It is not a de Polignac number, because 10423014332233 - 29 = 10423014331721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10423014332195 and 10423014332204.
It is not a weakly prime, because it can be changed into another prime (10423014332239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5211507166116 + 5211507166117.
It is an arithmetic number, because the mean of its divisors is an integer number (5211507166117).
Almost surely, 210423014332233 is an apocalyptic number.
It is an amenable number.
10423014332233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10423014332233 is an equidigital number, since it uses as much as digits as its factorization.
10423014332233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 10423014332233 its reverse (33223341032401), we get a palindrome (43646355364634).
The spelling of 10423014332233 in words is "ten trillion, four hundred twenty-three billion, fourteen million, three hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •