Base | Representation |
---|---|
bin | 1001010011101001101001… |
… | …0000001000111101010001 |
3 | 1100020021200022012202201101 |
4 | 2110322122100020331101 |
5 | 2320130043201140304 |
6 | 33433022302504401 |
7 | 2104216143666355 |
oct | 224723220107521 |
9 | 40207608182641 |
10 | 10233200021329 |
11 | 329596a6a667a |
12 | 1193319b95101 |
13 | 592ca97b7c1c |
14 | 27540a64b465 |
15 | 12b2c7de58a4 |
hex | 94e9a408f51 |
10233200021329 has 2 divisors, whose sum is σ = 10233200021330. Its totient is φ = 10233200021328.
The previous prime is 10233200021299. The next prime is 10233200021377. The reversal of 10233200021329 is 92312000233201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8512769052225 + 1720430969104 = 2917665^2 + 1311652^2 .
It is a cyclic number.
It is not a de Polignac number, because 10233200021329 - 27 = 10233200021201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10233200021297 and 10233200021306.
It is not a weakly prime, because it can be changed into another prime (10233200021399) 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, 5116600010664 + 5116600010665.
It is an arithmetic number, because the mean of its divisors is an integer number (5116600010665).
Almost surely, 210233200021329 is an apocalyptic number.
It is an amenable number.
10233200021329 is a deficient number, since it is larger than the sum of its proper divisors (1).
10233200021329 is an equidigital number, since it uses as much as digits as its factorization.
10233200021329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 10233200021329 in words is "ten trillion, two hundred thirty-three billion, two hundred million, twenty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •