Base | Representation |
---|---|
bin | 111100101000110110… |
… | …1111101010101111001 |
3 | 110110010020221110211221 |
4 | 1321101231331111321 |
5 | 4113142311133423 |
6 | 135453334552041 |
7 | 12256654626220 |
oct | 1712155752571 |
9 | 413106843757 |
10 | 130220021113 |
11 | 50253897266 |
12 | 212a2508621 |
13 | c38364ba40 |
14 | 64347bdcb7 |
15 | 35c2324e5d |
hex | 1e51b7d579 |
130220021113 has 16 divisors (see below), whose sum is σ = 160308781696. Its totient is φ = 103006805760.
The previous prime is 130220021083. The next prime is 130220021117. The reversal of 130220021113 is 311120022031.
It is a cyclic number.
It is not a de Polignac number, because 130220021113 - 217 = 130219890041 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130220021117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221398 + ... + 556288.
It is an arithmetic number, because the mean of its divisors is an integer number (10019298856).
Almost surely, 2130220021113 is an apocalyptic number.
130220021113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130220021113 is a deficient number, since it is larger than the sum of its proper divisors (30088760583).
130220021113 is a wasteful number, since it uses less digits than its factorization.
130220021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339184.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 130220021113 its reverse (311120022031), we get a palindrome (441340043144).
The spelling of 130220021113 in words is "one hundred thirty billion, two hundred twenty million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •