Base | Representation |
---|---|
bin | 110111111000101011… |
… | …0000100011001001101 |
3 | 102110202221000210212122 |
4 | 1233301112010121031 |
5 | 3431241340224323 |
6 | 131044443342325 |
7 | 11446016315030 |
oct | 1576126043115 |
9 | 373687023778 |
10 | 120013211213 |
11 | 46996368985 |
12 | 1b3142219a5 |
13 | b417b6175c |
14 | 5b46dc5017 |
15 | 31c6214ec8 |
hex | 1bf158464d |
120013211213 has 32 divisors (see below), whose sum is σ = 143776539648. Its totient is φ = 98029900800.
The previous prime is 120013211113. The next prime is 120013211233. The reversal of 120013211213 is 312112310021.
It is a cyclic number.
It is not a de Polignac number, because 120013211213 - 216 = 120013145677 is a prime.
It is a super-2 number, since 2×1200132112132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120013211191 and 120013211200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120013211233) by changing a digit.
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 in 31 ways as a sum of consecutive naturals, for example, 7019231 + ... + 7036307.
It is an arithmetic number, because the mean of its divisors is an integer number (4493016864).
Almost surely, 2120013211213 is an apocalyptic number.
It is an amenable number.
120013211213 is a deficient number, since it is larger than the sum of its proper divisors (23763328435).
120013211213 is a wasteful number, since it uses less digits than its factorization.
120013211213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17693.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 120013211213 its reverse (312112310021), we get a palindrome (432125521234).
The spelling of 120013211213 in words is "one hundred twenty billion, thirteen million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •