Base | Representation |
---|---|
bin | 101110101101100010… |
… | …1000110110111100101 |
3 | 100120220221022111120121 |
4 | 1131123011012313211 |
5 | 3120414423011232 |
6 | 114025521001541 |
7 | 10150555410646 |
oct | 1353305066745 |
9 | 316827274517 |
10 | 100312313317 |
11 | 395a675a787 |
12 | 175364832b1 |
13 | 95c842c018 |
14 | 4bd871b6cd |
15 | 292187bd97 |
hex | 175b146de5 |
100312313317 has 2 divisors, whose sum is σ = 100312313318. Its totient is φ = 100312313316.
The previous prime is 100312313281. The next prime is 100312313327. The reversal of 100312313317 is 713313213001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54928828161 + 45383485156 = 234369^2 + 213034^2 .
It is an emirp because it is prime and its reverse (713313213001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100312313317 - 231 = 98164829669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100312313291 and 100312313300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100312313327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50156156658 + 50156156659.
It is an arithmetic number, because the mean of its divisors is an integer number (50156156659).
Almost surely, 2100312313317 is an apocalyptic number.
It is an amenable number.
100312313317 is a deficient number, since it is larger than the sum of its proper divisors (1).
100312313317 is an equidigital number, since it uses as much as digits as its factorization.
100312313317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 100312313317 its reverse (713313213001), we get a palindrome (813625526318).
The spelling of 100312313317 in words is "one hundred billion, three hundred twelve million, three hundred thirteen thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •