Base | Representation |
---|---|
bin | 1001010010111101010110… |
… | …1111001110010001101001 |
3 | 1100012010222212220210021202 |
4 | 2110233111233032101221 |
5 | 2314431222124422213 |
6 | 33423334553213545 |
7 | 2103315445014356 |
oct | 224572557162151 |
9 | 40163885823252 |
10 | 10221313123433 |
11 | 329091a875315 |
12 | 1190b611012b5 |
13 | 591b33c03729 |
14 | 2749dda7162d |
15 | 12ad2e566b58 |
hex | 94bd5bce469 |
10221313123433 has 2 divisors, whose sum is σ = 10221313123434. Its totient is φ = 10221313123432.
The previous prime is 10221313123327. The next prime is 10221313123447. The reversal of 10221313123433 is 33432131312201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9752460689449 + 468852433984 = 3122893^2 + 684728^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10221313123433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221313123396 and 10221313123405.
It is not a weakly prime, because it can be changed into another prime (10221313123633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110656561716 + 5110656561717.
It is an arithmetic number, because the mean of its divisors is an integer number (5110656561717).
Almost surely, 210221313123433 is an apocalyptic number.
It is an amenable number.
10221313123433 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221313123433 is an equidigital number, since it uses as much as digits as its factorization.
10221313123433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 10221313123433 its reverse (33432131312201), we get a palindrome (43653444435634).
The spelling of 10221313123433 in words is "ten trillion, two hundred twenty-one billion, three hundred thirteen million, one hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •