Base | Representation |
---|---|
bin | 111100100010010111… |
… | …0101010001101110111 |
3 | 110102120001212222210202 |
4 | 1321010232222031313 |
5 | 4112221014213421 |
6 | 135415552111115 |
7 | 12251400425021 |
oct | 1710456521567 |
9 | 412501788722 |
10 | 130002101111 |
11 | 50151884793 |
12 | 2124153549b |
13 | c34a45bcac |
14 | 6413895011 |
15 | 35ad12b10b |
hex | 1e44baa377 |
130002101111 has 4 divisors (see below), whose sum is σ = 133025405832. Its totient is φ = 126978796392.
The previous prime is 130002101101. The next prime is 130002101129. The reversal of 130002101111 is 111101200031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111101200031 = 73 ⋅1521934247.
It is a cyclic number.
It is not a de Polignac number, because 130002101111 - 222 = 129997906807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130002101092 and 130002101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130002101101) 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, 1511652296 + ... + 1511652381.
It is an arithmetic number, because the mean of its divisors is an integer number (33256351458).
Almost surely, 2130002101111 is an apocalyptic number.
130002101111 is a deficient number, since it is larger than the sum of its proper divisors (3023304721).
130002101111 is an equidigital number, since it uses as much as digits as its factorization.
130002101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3023304720.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 130002101111 its reverse (111101200031), we get a palindrome (241103301142).
The spelling of 130002101111 in words is "one hundred thirty billion, two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •