Base | Representation |
---|---|
bin | 110111111000010010… |
… | …0001000010011010101 |
3 | 102110202000101201010200 |
4 | 1233300210020103111 |
5 | 3431230012320041 |
6 | 131043255011113 |
7 | 11445500122215 |
oct | 1576044102325 |
9 | 373660351120 |
10 | 120000120021 |
11 | 46989a37311 |
12 | 1b30b969a99 |
13 | b415229ba2 |
14 | 5b45378245 |
15 | 31c4ecb1b6 |
hex | 1bf09084d5 |
120000120021 has 24 divisors (see below), whose sum is σ = 177316374144. Its totient is φ = 78167505600.
The previous prime is 120000120007. The next prime is 120000120061. The reversal of 120000120021 is 120021000021.
It is not a de Polignac number, because 120000120021 - 214 = 120000103637 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 120000119985 and 120000120012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120000120061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18210 + ... + 490236.
It is an arithmetic number, because the mean of its divisors is an integer number (7388182256).
Almost surely, 2120000120021 is an apocalyptic number.
It is an amenable number.
120000120021 is a deficient number, since it is larger than the sum of its proper divisors (57316254123).
120000120021 is a wasteful number, since it uses less digits than its factorization.
120000120021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472681 (or 472678 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 120000120021 its reverse (120021000021), we get a palindrome (240021120042).
The spelling of 120000120021 in words is "one hundred twenty billion, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •