Base | Representation |
---|---|
bin | 101110101010010010… |
… | …0100111010001101101 |
3 | 100120122022212111222121 |
4 | 1131110210213101231 |
5 | 3120204000211023 |
6 | 114011020512541 |
7 | 10145061366055 |
oct | 1352444472155 |
9 | 316568774877 |
10 | 100203132013 |
11 | 395500681a6 |
12 | 175059ab751 |
13 | 95ab9224ba |
14 | 4bc801a565 |
15 | 2916eb1d5d |
hex | 175492746d |
100203132013 has 2 divisors, whose sum is σ = 100203132014. Its totient is φ = 100203132012.
The previous prime is 100203131993. The next prime is 100203132017. The reversal of 100203132013 is 310231302001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51310404324 + 48892727689 = 226518^2 + 221117^2 .
It is an emirp because it is prime and its reverse (310231302001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100203132013 - 221 = 100201034861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100203132017) 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, 50101566006 + 50101566007.
It is an arithmetic number, because the mean of its divisors is an integer number (50101566007).
Almost surely, 2100203132013 is an apocalyptic number.
It is an amenable number.
100203132013 is a deficient number, since it is larger than the sum of its proper divisors (1).
100203132013 is an equidigital number, since it uses as much as digits as its factorization.
100203132013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 100203132013 its reverse (310231302001), we get a palindrome (410434434014).
The spelling of 100203132013 in words is "one hundred billion, two hundred three million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •