Base | Representation |
---|---|
bin | 101111010101111101… |
… | …1101111101011001001 |
3 | 100201102110210212000121 |
4 | 1132223323233223021 |
5 | 3131204204013023 |
6 | 114412255303241 |
7 | 10226306441011 |
oct | 1365373575311 |
9 | 321373725017 |
10 | 101668813513 |
11 | 3a132438423 |
12 | 1785481ab21 |
13 | 9783489c67 |
14 | 4cc6948c41 |
15 | 29a09ccd5d |
hex | 17abeefac9 |
101668813513 has 2 divisors, whose sum is σ = 101668813514. Its totient is φ = 101668813512.
The previous prime is 101668813501. The next prime is 101668813517. The reversal of 101668813513 is 315318866101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53695548729 + 47973264784 = 231723^2 + 219028^2 .
It is an emirp because it is prime and its reverse (315318866101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101668813513 - 213 = 101668805321 is a prime.
It is a super-2 number, since 2×1016688135132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101668813513.
It is not a weakly prime, because it can be changed into another prime (101668813517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50834406756 + 50834406757.
It is an arithmetic number, because the mean of its divisors is an integer number (50834406757).
Almost surely, 2101668813513 is an apocalyptic number.
It is an amenable number.
101668813513 is a deficient number, since it is larger than the sum of its proper divisors (1).
101668813513 is an equidigital number, since it uses as much as digits as its factorization.
101668813513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 43.
The spelling of 101668813513 in words is "one hundred one billion, six hundred sixty-eight million, eight hundred thirteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •