Base | Representation |
---|---|
bin | 1001001100100110001000… |
… | …0011011110100100000001 |
3 | 1022210200211112101220021222 |
4 | 2103021202003132210001 |
5 | 2311133333002443234 |
6 | 33301215432524425 |
7 | 2062365511416401 |
oct | 223114203364401 |
9 | 38720745356258 |
10 | 10111998093569 |
11 | 3249524339429 |
12 | 1173933850715 |
13 | 5847325b2ac8 |
14 | 26d5cd832801 |
15 | 12808267342e |
hex | 932620de901 |
10111998093569 has 2 divisors, whose sum is σ = 10111998093570. Its totient is φ = 10111998093568.
The previous prime is 10111998093511. The next prime is 10111998093577. The reversal of 10111998093569 is 96539089911101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5569302643969 + 4542695449600 = 2359937^2 + 2131360^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111998093569 - 28 = 10111998093313 is a prime.
It is a super-2 number, since 2×101119980935692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10111998093469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055999046784 + 5055999046785.
It is an arithmetic number, because the mean of its divisors is an integer number (5055999046785).
Almost surely, 210111998093569 is an apocalyptic number.
It is an amenable number.
10111998093569 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111998093569 is an equidigital number, since it uses as much as digits as its factorization.
10111998093569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4723920, while the sum is 62.
The spelling of 10111998093569 in words is "ten trillion, one hundred eleven billion, nine hundred ninety-eight million, ninety-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •