Base | Representation |
---|---|
bin | 1001010011101000111110… |
… | …0001100001110101111101 |
3 | 1100020021012202112021111012 |
4 | 2110322033201201311331 |
5 | 2320124211111432313 |
6 | 33432552353005005 |
7 | 2104211530046312 |
oct | 224721741416575 |
9 | 40207182467435 |
10 | 10233020030333 |
11 | 329588803a791 |
12 | 1193289853765 |
13 | 592c7b418189 |
14 | 2753d0796d09 |
15 | 12b2b71deda8 |
hex | 94e8f861d7d |
10233020030333 has 2 divisors, whose sum is σ = 10233020030334. Its totient is φ = 10233020030332.
The previous prime is 10233020030293. The next prime is 10233020030357. The reversal of 10233020030333 is 33303002033201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10215611338969 + 17408691364 = 3196187^2 + 131942^2 .
It is a cyclic number.
It is not a de Polignac number, because 10233020030333 - 26 = 10233020030269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10233020030299 and 10233020030308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10233020330333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5116510015166 + 5116510015167.
It is an arithmetic number, because the mean of its divisors is an integer number (5116510015167).
Almost surely, 210233020030333 is an apocalyptic number.
It is an amenable number.
10233020030333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10233020030333 is an equidigital number, since it uses as much as digits as its factorization.
10233020030333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 10233020030333 its reverse (33303002033201), we get a palindrome (43536022063534).
The spelling of 10233020030333 in words is "ten trillion, two hundred thirty-three billion, twenty million, thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •