Base | Representation |
---|---|
bin | 10111011111100010001111… |
… | …000010001101101011111001 |
3 | 111112211111111002122110112102 |
4 | 113133202033002031223321 |
5 | 102020312212021313214 |
6 | 1003425311014153145 |
7 | 30522530526523451 |
oct | 2737421702155371 |
9 | 445744432573472 |
10 | 103322132994809 |
11 | 2aa157415227a3 |
12 | b7086313527b5 |
13 | 458630a050381 |
14 | 1b72b6452ad61 |
15 | be29a4821bde |
hex | 5df88f08daf9 |
103322132994809 has 2 divisors, whose sum is σ = 103322132994810. Its totient is φ = 103322132994808.
The previous prime is 103322132994793. The next prime is 103322132994841. The reversal of 103322132994809 is 908499231223301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96184702464400 + 7137430530409 = 9807380^2 + 2671597^2 .
It is an emirp because it is prime and its reverse (908499231223301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103322132994809 - 24 = 103322132994793 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (103322132990809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51661066497404 + 51661066497405.
It is an arithmetic number, because the mean of its divisors is an integer number (51661066497405).
Almost surely, 2103322132994809 is an apocalyptic number.
It is an amenable number.
103322132994809 is a deficient number, since it is larger than the sum of its proper divisors (1).
103322132994809 is an equidigital number, since it uses as much as digits as its factorization.
103322132994809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5038848, while the sum is 56.
The spelling of 103322132994809 in words is "one hundred three trillion, three hundred twenty-two billion, one hundred thirty-two million, nine hundred ninety-four thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •