Base | Representation |
---|---|
bin | 11101100101001111111110… |
… | …111110101100011110100110 |
3 | 122001122201220222110102220102 |
4 | 131211033332332230132212 |
5 | 114023102203321223420 |
6 | 1140412315343104102 |
7 | 36255432621063002 |
oct | 3545177676543646 |
9 | 561581828412812 |
10 | 130103132211110 |
11 | 38500479395953 |
12 | 12712a378a2032 |
13 | 5779898c8a186 |
14 | 241b04d1dd702 |
15 | 1009433790a75 |
hex | 7653fefac7a6 |
130103132211110 has 16 divisors (see below), whose sum is σ = 234797088738816. Its totient is φ = 51905374938048.
The previous prime is 130103132211067. The next prime is 130103132211161. The reversal of 130103132211110 is 11112231301031.
It is a super-2 number, since 2×1301031322111102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16984739279 + ... + 16984746938.
It is an arithmetic number, because the mean of its divisors is an integer number (14674818046176).
Almost surely, 2130103132211110 is an apocalyptic number.
130103132211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130103132211110 is a deficient number, since it is larger than the sum of its proper divisors (104693956527706).
130103132211110 is a wasteful number, since it uses less digits than its factorization.
130103132211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33969486607.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 130103132211110 its reverse (11112231301031), we get a palindrome (141215363512141).
The spelling of 130103132211110 in words is "one hundred thirty trillion, one hundred three billion, one hundred thirty-two million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •