Base | Representation |
---|---|
bin | 101111001011111011… |
… | …1101101000101011101 |
3 | 100200120000102121211022 |
4 | 1132113313231011131 |
5 | 3130012021210023 |
6 | 114315032533525 |
7 | 10215051400466 |
oct | 1362767550535 |
9 | 320500377738 |
10 | 101332210013 |
11 | 39a7a433211 |
12 | 1777bb512a5 |
13 | 972b8145a8 |
14 | 4c93d67d6d |
15 | 298118d7c8 |
hex | 1797ded15d |
101332210013 has 2 divisors, whose sum is σ = 101332210014. Its totient is φ = 101332210012.
The previous prime is 101332209983. The next prime is 101332210069. The reversal of 101332210013 is 310012233101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90987896164 + 10344313849 = 301642^2 + 101707^2 .
It is a cyclic number.
It is not a de Polignac number, because 101332210013 - 218 = 101331947869 is a prime.
It is a super-2 number, since 2×1013322100132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101332209973 and 101332210000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101332210093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50666105006 + 50666105007.
It is an arithmetic number, because the mean of its divisors is an integer number (50666105007).
Almost surely, 2101332210013 is an apocalyptic number.
It is an amenable number.
101332210013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101332210013 is an equidigital number, since it uses as much as digits as its factorization.
101332210013 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 101332210013 its reverse (310012233101), we get a palindrome (411344443114).
The spelling of 101332210013 in words is "one hundred one billion, three hundred thirty-two million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •