Base | Representation |
---|---|
bin | 11011010010011001111001… |
… | …111100001111011110110101 |
3 | 120201221001000011022221002020 |
4 | 123102121321330033132311 |
5 | 111212234110114120041 |
6 | 1103124432314303353 |
7 | 34164403532522205 |
oct | 3322317174173665 |
9 | 521831004287066 |
10 | 120012022020021 |
11 | 3526a8a37a584a |
12 | 11563173427b59 |
13 | 51c71150011a1 |
14 | 218c881980405 |
15 | dd1bc4cc5866 |
hex | 6d2679f0f7b5 |
120012022020021 has 8 divisors (see below), whose sum is σ = 160043699455680. Its totient is φ = 79994179632192.
The previous prime is 120012022020017. The next prime is 120012022020031. The reversal of 120012022020021 is 120020220210021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120012022020021 - 22 = 120012022020017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120012022020031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3458741716 + ... + 3458776413.
It is an arithmetic number, because the mean of its divisors is an integer number (20005462431960).
Almost surely, 2120012022020021 is an apocalyptic number.
It is an amenable number.
120012022020021 is a deficient number, since it is larger than the sum of its proper divisors (40031677435659).
120012022020021 is an equidigital number, since it uses as much as digits as its factorization.
120012022020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6917523915.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 120012022020021 its reverse (120020220210021), we get a palindrome (240032242230042).
The spelling of 120012022020021 in words is "one hundred twenty trillion, twelve billion, twenty-two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •