Base | Representation |
---|---|
bin | 101110110000001110… |
… | …0011111111001010101 |
3 | 100121011012200212221001 |
4 | 1131200130133321111 |
5 | 3121110444044341 |
6 | 114042454223301 |
7 | 10153030506553 |
oct | 1354034377125 |
9 | 317135625831 |
10 | 100402331221 |
11 | 39642553545 |
12 | 17560654b31 |
13 | 9610c8915a |
14 | 4c06670bd3 |
15 | 292970dd31 |
hex | 176071fe55 |
100402331221 has 2 divisors, whose sum is σ = 100402331222. Its totient is φ = 100402331220.
The previous prime is 100402331207. The next prime is 100402331303. The reversal of 100402331221 is 122133204001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86253228721 + 14149102500 = 293689^2 + 118950^2 .
It is an emirp because it is prime and its reverse (122133204001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100402331221 - 211 = 100402329173 is a prime.
It is a super-2 number, since 2×1004023312212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100402337221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50201165610 + 50201165611.
It is an arithmetic number, because the mean of its divisors is an integer number (50201165611).
Almost surely, 2100402331221 is an apocalyptic number.
It is an amenable number.
100402331221 is a deficient number, since it is larger than the sum of its proper divisors (1).
100402331221 is an equidigital number, since it uses as much as digits as its factorization.
100402331221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 100402331221 its reverse (122133204001), we get a palindrome (222535535222).
The spelling of 100402331221 in words is "one hundred billion, four hundred two million, three hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •