Base | Representation |
---|---|
bin | 111100100010111010… |
… | …0000101100100110111 |
3 | 110102121100010122111211 |
4 | 1321011310011210313 |
5 | 4112240144113421 |
6 | 135421442142251 |
7 | 12252011216161 |
oct | 1710564054467 |
9 | 412540118454 |
10 | 130020301111 |
11 | 50161085708 |
12 | 21247651987 |
13 | c35116201c |
14 | 6416071931 |
15 | 35aea239e1 |
hex | 1e45d05937 |
130020301111 has 8 divisors (see below), whose sum is σ = 134532165600. Its totient is φ = 125510330400.
The previous prime is 130020301097. The next prime is 130020301121. The reversal of 130020301111 is 111103020031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130020301111 - 235 = 95660562743 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130020301091 and 130020301100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130020301121) 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 in 7 ways as a sum of consecutive naturals, for example, 333040 + ... + 609061.
It is an arithmetic number, because the mean of its divisors is an integer number (16816520700).
Almost surely, 2130020301111 is an apocalyptic number.
130020301111 is a deficient number, since it is larger than the sum of its proper divisors (4511864489).
130020301111 is an equidigital number, since it uses as much as digits as its factorization.
130020301111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946889.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 130020301111 its reverse (111103020031), we get a palindrome (241123321142).
The spelling of 130020301111 in words is "one hundred thirty billion, twenty million, three hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •