Base | Representation |
---|---|
bin | 101110101101001111… |
… | …0001010001100010001 |
3 | 100120220020002210002022 |
4 | 1131122132022030101 |
5 | 3120404314301223 |
6 | 114024514101225 |
7 | 10150402545116 |
oct | 1353236121421 |
9 | 316806083068 |
10 | 100302103313 |
11 | 395a0a16865 |
12 | 17532b7a815 |
13 | 95c62959b9 |
14 | 4bd722090d |
15 | 2920a11ac8 |
hex | 175a78a311 |
100302103313 has 2 divisors, whose sum is σ = 100302103314. Its totient is φ = 100302103312.
The previous prime is 100302103303. The next prime is 100302103331. The reversal of 100302103313 is 313301203001.
Together with next prime (100302103331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97498189009 + 2803914304 = 312247^2 + 52952^2 .
It is a cyclic number.
It is not a de Polignac number, because 100302103313 - 222 = 100297909009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100302103291 and 100302103300.
It is not a weakly prime, because it can be changed into another prime (100302103303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50151051656 + 50151051657.
It is an arithmetic number, because the mean of its divisors is an integer number (50151051657).
Almost surely, 2100302103313 is an apocalyptic number.
It is an amenable number.
100302103313 is a deficient number, since it is larger than the sum of its proper divisors (1).
100302103313 is an equidigital number, since it uses as much as digits as its factorization.
100302103313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 100302103313 its reverse (313301203001), we get a palindrome (413603306314).
The spelling of 100302103313 in words is "one hundred billion, three hundred two million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •