Base | Representation |
---|---|
bin | 10110110000110011110101… |
… | …110001000000111100100001 |
3 | 111010110112120010020211112201 |
4 | 112300303311301000330201 |
5 | 101110210240034031032 |
6 | 552530243210453201 |
7 | 30041540245102321 |
oct | 2660636561007441 |
9 | 433415503224481 |
10 | 100111221002017 |
11 | 29997a263a8165 |
12 | b28a285434201 |
13 | 43b25a85ab844 |
14 | 1aa15a2231281 |
15 | b891c8ba08e7 |
hex | 5b0cf5c40f21 |
100111221002017 has 2 divisors, whose sum is σ = 100111221002018. Its totient is φ = 100111221002016.
The previous prime is 100111221001951. The next prime is 100111221002033. The reversal of 100111221002017 is 710200122111001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57514765654801 + 42596455347216 = 7583849^2 + 6526596^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111221002017 - 211 = 100111220999969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100111221001985 and 100111221002003.
It is not a weakly prime, because it can be changed into another prime (100111224002017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055610501008 + 50055610501009.
It is an arithmetic number, because the mean of its divisors is an integer number (50055610501009).
Almost surely, 2100111221002017 is an apocalyptic number.
It is an amenable number.
100111221002017 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111221002017 is an equidigital number, since it uses as much as digits as its factorization.
100111221002017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 100111221002017 its reverse (710200122111001), we get a palindrome (810311343113018).
The spelling of 100111221002017 in words is "one hundred trillion, one hundred eleven billion, two hundred twenty-one million, two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •