Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1111011010011100011 |
3 | 100120010020201021120111 |
4 | 1131020201323103203 |
5 | 3114300240213102 |
6 | 113535002352151 |
7 | 10140056222332 |
oct | 1351041732343 |
9 | 316106637514 |
10 | 100001101027 |
11 | 39457018343 |
12 | 1746a1bb657 |
13 | 9578b06939 |
14 | 4ba9269d19 |
15 | 29043a5cd7 |
hex | 174887b4e3 |
100001101027 has 2 divisors, whose sum is σ = 100001101028. Its totient is φ = 100001101026.
The previous prime is 100001101009. The next prime is 100001101061. The reversal of 100001101027 is 720101100001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001101027 is a prime.
It is a super-2 number, since 2×1000011010272 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100001100998 and 100001101016.
It is not a weakly prime, because it can be changed into another prime (100001101097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000550513 + 50000550514.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550514).
Almost surely, 2100001101027 is an apocalyptic number.
100001101027 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001101027 is an equidigital number, since it uses as much as digits as its factorization.
100001101027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 13.
Adding to 100001101027 its reverse (720101100001), we get a palindrome (820102201028).
The spelling of 100001101027 in words is "one hundred billion, one million, one hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •