Base | Representation |
---|---|
bin | 110111111011110110… |
… | …1011110100100000101 |
3 | 102111001100222210122210 |
4 | 1233313231132210011 |
5 | 3432001210323023 |
6 | 131103220414033 |
7 | 11451454150512 |
oct | 1576755364405 |
9 | 374040883583 |
10 | 120120011013 |
11 | 46a40684182 |
12 | 1b343b47319 |
13 | b4340162c2 |
14 | 5b57266309 |
15 | 31d07ae593 |
hex | 1bf7b5e905 |
120120011013 has 16 divisors (see below), whose sum is σ = 161833468160. Its totient is φ = 79243508736.
The previous prime is 120120010987. The next prime is 120120011021. The reversal of 120120011013 is 310110021021.
It is not a de Polignac number, because 120120011013 - 29 = 120120010501 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120120011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120120011413) 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, 2457153 + ... + 2505561.
It is an arithmetic number, because the mean of its divisors is an integer number (10114591760).
Almost surely, 2120120011013 is an apocalyptic number.
It is an amenable number.
120120011013 is a deficient number, since it is larger than the sum of its proper divisors (41713457147).
120120011013 is an equidigital number, since it uses as much as digits as its factorization.
120120011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57036.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 120120011013 its reverse (310110021021), we get a palindrome (430230032034).
The spelling of 120120011013 in words is "one hundred twenty billion, one hundred twenty million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •