Base | Representation |
---|---|
bin | 111100101000010010… |
… | …1110100101001000111 |
3 | 110110001221100202012111 |
4 | 1321100211310221013 |
5 | 4113122441023421 |
6 | 135451421401451 |
7 | 12256335120061 |
oct | 1712045645107 |
9 | 413057322174 |
10 | 130201111111 |
11 | 50244150965 |
12 | 21298109287 |
13 | c37c75a7a6 |
14 | 643209a731 |
15 | 35c083bee1 |
hex | 1e50974a47 |
130201111111 has 4 divisors (see below), whose sum is σ = 130928491800. Its totient is φ = 129473730424.
The previous prime is 130201111081. The next prime is 130201111151. The reversal of 130201111111 is 111111102031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130201111111 - 231 = 128053627463 is a prime.
It is a Duffinian number.
130201111111 is a modest number, since divided by 1111111 gives 13020 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 130201111091 and 130201111100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201111151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 363690076 + ... + 363690433.
It is an arithmetic number, because the mean of its divisors is an integer number (32732122950).
Almost surely, 2130201111111 is an apocalyptic number.
130201111111 is a deficient number, since it is larger than the sum of its proper divisors (727380689).
130201111111 is an equidigital number, since it uses as much as digits as its factorization.
130201111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 727380688.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 130201111111 its reverse (111111102031), we get a palindrome (241312213142).
The spelling of 130201111111 in words is "one hundred thirty billion, two hundred one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •