Base | Representation |
---|---|
bin | 111100100101010100… |
… | …0010110100110111011 |
3 | 110102210222012020011002 |
4 | 1321022220112212323 |
5 | 4112421341024402 |
6 | 135433450155215 |
7 | 12254012125163 |
oct | 1711250264673 |
9 | 412728166132 |
10 | 130101111227 |
11 | 501a275a52a |
12 | 2126a722b0b |
13 | c364b17069 |
14 | 6422aa95a3 |
15 | 35b6b87602 |
hex | 1e4aa169bb |
130101111227 has 2 divisors, whose sum is σ = 130101111228. Its totient is φ = 130101111226.
The previous prime is 130101111187. The next prime is 130101111229. The reversal of 130101111227 is 722111101031.
It is a strong prime.
It is an emirp because it is prime and its reverse (722111101031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130101111227 - 228 = 129832675771 is a prime.
Together with 130101111229, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 130101111199 and 130101111208.
It is not a weakly prime, because it can be changed into another prime (130101111229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65050555613 + 65050555614.
It is an arithmetic number, because the mean of its divisors is an integer number (65050555614).
Almost surely, 2130101111227 is an apocalyptic number.
130101111227 is a deficient number, since it is larger than the sum of its proper divisors (1).
130101111227 is an equidigital number, since it uses as much as digits as its factorization.
130101111227 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 130101111227 its reverse (722111101031), we get a palindrome (852212212258).
The spelling of 130101111227 in words is "one hundred thirty billion, one hundred one million, one hundred eleven thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •