Base | Representation |
---|---|
bin | 11101100011111011001000… |
… | …010001100101000001010101 |
3 | 122001100000202012221200210100 |
4 | 131203323020101211001111 |
5 | 114020104104121214310 |
6 | 1140302410354244313 |
7 | 36246026025655344 |
oct | 3543731021450125 |
9 | 561300665850710 |
10 | 130012020101205 |
11 | 38475873a39170 |
12 | 126b924a586699 |
13 | 57711089371c8 |
14 | 241688872db5b |
15 | 1006d9e989ec0 |
hex | 763ec8465055 |
130012020101205 has 48 divisors (see below), whose sum is σ = 245842286324544. Its totient is φ = 63035778243840.
The previous prime is 130012020101191. The next prime is 130012020101251. The reversal of 130012020101205 is 502101020210031.
It is not a de Polignac number, because 130012020101205 - 212 = 130012020097109 is a prime.
It is a super-2 number, since 2×1300120201012052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 102436702 + ... + 103698128.
It is an arithmetic number, because the mean of its divisors is an integer number (5121714298428).
Almost surely, 2130012020101205 is an apocalyptic number.
130012020101205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130012020101205 is a deficient number, since it is larger than the sum of its proper divisors (115830266223339).
130012020101205 is a wasteful number, since it uses less digits than its factorization.
130012020101205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1469666 (or 1469663 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 130012020101205 its reverse (502101020210031), we get a palindrome (632113040311236).
The spelling of 130012020101205 in words is "one hundred thirty trillion, twelve billion, twenty million, one hundred one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •