Base | Representation |
---|---|
bin | 101110101000001001… |
… | …0010011010111100101 |
3 | 100120110022120011101022 |
4 | 1131100102103113211 |
5 | 3120032043114023 |
6 | 113555531340525 |
7 | 10143226231613 |
oct | 1352022232745 |
9 | 316408504338 |
10 | 100131223013 |
11 | 39513512978 |
12 | 174a58b1745 |
13 | 9599a65ab3 |
14 | 4bbc65c6b3 |
15 | 2910a0a7c8 |
hex | 17504935e5 |
100131223013 has 2 divisors, whose sum is σ = 100131223014. Its totient is φ = 100131223012.
The previous prime is 100131223001. The next prime is 100131223063. The reversal of 100131223013 is 310322131001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68928826849 + 31202396164 = 262543^2 + 176642^2 .
It is an emirp because it is prime and its reverse (310322131001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100131223013 - 218 = 100130960869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100131222982 and 100131223000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100131223063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50065611506 + 50065611507.
It is an arithmetic number, because the mean of its divisors is an integer number (50065611507).
Almost surely, 2100131223013 is an apocalyptic number.
It is an amenable number.
100131223013 is a deficient number, since it is larger than the sum of its proper divisors (1).
100131223013 is an equidigital number, since it uses as much as digits as its factorization.
100131223013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100131223013 its reverse (310322131001), we get a palindrome (410453354014).
The spelling of 100131223013 in words is "one hundred billion, one hundred thirty-one million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •