Base | Representation |
---|---|
bin | 110010010101110101111001… |
… | …011100101011000000001101 |
3 | 1002000220221122010020011110111 |
4 | 302111311321130223000031 |
5 | 213004432433003411223 |
6 | 2102515135220240021 |
7 | 64430601223440556 |
oct | 6225657134530015 |
9 | 1060827563204414 |
10 | 221403306700813 |
11 | 64600684729966 |
12 | 209b953b540011 |
13 | 967031c266a83 |
14 | 3c95d976cd32d |
15 | 1a8e31c50d30d |
hex | c95d7972b00d |
221403306700813 has 2 divisors, whose sum is σ = 221403306700814. Its totient is φ = 221403306700812.
The previous prime is 221403306700757. The next prime is 221403306700819. The reversal of 221403306700813 is 318007603304122.
221403306700813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215643292300804 + 5760014400009 = 14684798^2 + 2400003^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221403306700813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221403306700819) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110701653350406 + 110701653350407.
It is an arithmetic number, because the mean of its divisors is an integer number (110701653350407).
Almost surely, 2221403306700813 is an apocalyptic number.
It is an amenable number.
221403306700813 is a deficient number, since it is larger than the sum of its proper divisors (1).
221403306700813 is an equidigital number, since it uses as much as digits as its factorization.
221403306700813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 40.
The spelling of 221403306700813 in words is "two hundred twenty-one trillion, four hundred three billion, three hundred six million, seven hundred thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •