Base | Representation |
---|---|
bin | 111100100101100101… |
… | …1000110101011010100 |
3 | 110102211121100001102112 |
4 | 1321023023012223110 |
5 | 4112431204033022 |
6 | 135434413330152 |
7 | 12254152426262 |
oct | 1711313065324 |
9 | 412747301375 |
10 | 130110221012 |
11 | 501a7911882 |
12 | 21271796958 |
13 | c366986675 |
14 | 6423d9b432 |
15 | 35b78868e2 |
hex | 1e4b2c6ad4 |
130110221012 has 6 divisors (see below), whose sum is σ = 227692886778. Its totient is φ = 65055110504.
The previous prime is 130110220979. The next prime is 130110221029. The reversal of 130110221012 is 210122011031.
It can be written as a sum of positive squares in only one way, i.e., 122642841616 + 7467379396 = 350204^2 + 86414^2 .
It is a super-2 number, since 2×1301102210122 (a number of 23 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 (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16263777623 + ... + 16263777630.
It is an arithmetic number, because the mean of its divisors is an integer number (37948814463).
Almost surely, 2130110221012 is an apocalyptic number.
It is an amenable number.
130110221012 is a deficient number, since it is larger than the sum of its proper divisors (97582665766).
130110221012 is a wasteful number, since it uses less digits than its factorization.
130110221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32527555257 (or 32527555255 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 130110221012 its reverse (210122011031), we get a palindrome (340232232043).
The spelling of 130110221012 in words is "one hundred thirty billion, one hundred ten million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •