Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …100101111111110110111011 |
3 | 111010110111222201102021201112 |
4 | 112300303220211333312323 |
5 | 101110204312000311141 |
6 | 552530205234110535 |
7 | 30041531622515243 |
oct | 2660635045776673 |
9 | 433414881367645 |
10 | 100111000010171 |
11 | 29997922687777 |
12 | b28a22341b44b |
13 | 43b2571884837 |
14 | 1aa1580b46b23 |
15 | b891b459b7eb |
hex | 5b0ce897fdbb |
100111000010171 has 2 divisors, whose sum is σ = 100111000010172. Its totient is φ = 100111000010170.
The previous prime is 100111000010011. The next prime is 100111000010179. The reversal of 100111000010171 is 171010000111001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100111000010171 - 226 = 100110932901307 is a prime.
It is not a weakly prime, because it can be changed into another prime (100111000010179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055500005085 + 50055500005086.
It is an arithmetic number, because the mean of its divisors is an integer number (50055500005086).
Almost surely, 2100111000010171 is an apocalyptic number.
100111000010171 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111000010171 is an equidigital number, since it uses as much as digits as its factorization.
100111000010171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 100111000010171 its reverse (171010000111001), we get a palindrome (271121000121172).
The spelling of 100111000010171 in words is "one hundred trillion, one hundred eleven billion, ten thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •