Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1010110100001010101 |
3 | 100120101211122000222112 |
4 | 1131033001112201111 |
5 | 3120011130033021 |
6 | 113553452440405 |
7 | 10142550656543 |
oct | 1351701264125 |
9 | 316354560875 |
10 | 100110002261 |
11 | 39502539465 |
12 | 1749a779105 |
13 | 9595545b39 |
14 | 4bb98d6d93 |
15 | 290dc17d5b |
hex | 174f056855 |
100110002261 has 2 divisors, whose sum is σ = 100110002262. Its totient is φ = 100110002260.
The previous prime is 100110002249. The next prime is 100110002273. The reversal of 100110002261 is 162200011001.
It is a balanced prime because it is at equal distance from previous prime (100110002249) and next prime (100110002273).
It can be written as a sum of positive squares in only one way, i.e., 72097620100 + 28012382161 = 268510^2 + 167369^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100110002261 is a prime.
It is a super-2 number, since 2×1001100022612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110002221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055001130 + 50055001131.
It is an arithmetic number, because the mean of its divisors is an integer number (50055001131).
Almost surely, 2100110002261 is an apocalyptic number.
It is an amenable number.
100110002261 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110002261 is an equidigital number, since it uses as much as digits as its factorization.
100110002261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100110002261 its reverse (162200011001), we get a palindrome (262310013262).
The spelling of 100110002261 in words is "one hundred billion, one hundred ten million, two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •