Base | Representation |
---|---|
bin | 11011010010100011011000… |
… | …100111000000000100110010 |
3 | 120201222000021111102011100222 |
4 | 123102203120213000010302 |
5 | 111212420431224101002 |
6 | 1103133234304413042 |
7 | 34165214003023361 |
oct | 3322433047000462 |
9 | 521860244364328 |
10 | 120022200222002 |
11 | 35274147064621 |
12 | 11565134017182 |
13 | 51c80778b3000 |
14 | 218d16964d7d8 |
15 | dd20bd6341a2 |
hex | 6d28d89c0132 |
120022200222002 has 64 divisors (see below), whose sum is σ = 200582093456640. Its totient is φ = 53828433360000.
The previous prime is 120022200221969. The next prime is 120022200222031. The reversal of 120022200222002 is 200222002220021.
120022200222002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1200222002220022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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, 43891523 + ... + 46545785.
It is an arithmetic number, because the mean of its divisors is an integer number (3134095210260).
Almost surely, 2120022200222002 is an apocalyptic number.
120022200222002 is a deficient number, since it is larger than the sum of its proper divisors (80559893234638).
120022200222002 is a wasteful number, since it uses less digits than its factorization.
120022200222002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2654596 (or 2654570 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 120022200222002 its reverse (200222002220021), we get a palindrome (320244202442023).
The spelling of 120022200222002 in words is "one hundred twenty trillion, twenty-two billion, two hundred million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •