Base | Representation |
---|---|
bin | 110111111000100111… |
… | …0011100000111001101 |
3 | 102110202210021012101120 |
4 | 1233301032130013031 |
5 | 3431240332224323 |
6 | 131044332431153 |
7 | 11445663315105 |
oct | 1576116340715 |
9 | 373683235346 |
10 | 120011211213 |
11 | 46995222293 |
12 | 1b3136184b9 |
13 | b41761131a |
14 | 5b46a24205 |
15 | 31c5e6c5e3 |
hex | 1bf139c1cd |
120011211213 has 8 divisors (see below), whose sum is σ = 164339676768. Its totient is φ = 77845109904.
The previous prime is 120011211211. The next prime is 120011211247. The reversal of 120011211213 is 312112110021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120011211213 - 21 = 120011211211 is a prime.
It is a super-2 number, since 2×1200112112132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 120011211192 and 120011211201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120011211211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 540590931 + ... + 540591152.
It is an arithmetic number, because the mean of its divisors is an integer number (20542459596).
Almost surely, 2120011211213 is an apocalyptic number.
It is an amenable number.
120011211213 is a deficient number, since it is larger than the sum of its proper divisors (44328465555).
120011211213 is a wasteful number, since it uses less digits than its factorization.
120011211213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081182123.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 120011211213 its reverse (312112110021), we get a palindrome (432123321234).
The spelling of 120011211213 in words is "one hundred twenty billion, eleven million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •