Base | Representation |
---|---|
bin | 111100101000101100… |
… | …0001001100101101111 |
3 | 110110002212012000121010 |
4 | 1321101120021211233 |
5 | 4113134330212421 |
6 | 135453012240303 |
7 | 12256555215453 |
oct | 1712130114557 |
9 | 413085160533 |
10 | 130214304111 |
11 | 50250641a71 |
12 | 212a0610093 |
13 | c3823c97b8 |
14 | 6433b32663 |
15 | 35c1a96076 |
hex | 1e5160996f |
130214304111 has 4 divisors (see below), whose sum is σ = 173619072152. Its totient is φ = 86809536072.
The previous prime is 130214304107. The next prime is 130214304137. The reversal of 130214304111 is 111403412031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 130214304111 - 22 = 130214304107 is a prime.
It is a super-2 number, since 2×1302143041112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130214304161) 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 3 ways as a sum of consecutive naturals, for example, 21702384016 + ... + 21702384021.
It is an arithmetic number, because the mean of its divisors is an integer number (43404768038).
Almost surely, 2130214304111 is an apocalyptic number.
130214304111 is a deficient number, since it is larger than the sum of its proper divisors (43404768041).
130214304111 is an equidigital number, since it uses as much as digits as its factorization.
130214304111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43404768040.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 130214304111 its reverse (111403412031), we get a palindrome (241617716142).
The spelling of 130214304111 in words is "one hundred thirty billion, two hundred fourteen million, three hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •