Base | Representation |
---|---|
bin | 11011010010100001100001… |
… | …011100100101010011101110 |
3 | 120201221211010011112021101221 |
4 | 123102201201130211103232 |
5 | 111212402332424032342 |
6 | 1103132304050253554 |
7 | 34165113315651313 |
oct | 3322414134452356 |
9 | 521854104467357 |
10 | 120020201002222 |
11 | 35273310600174 |
12 | 115648765872ba |
13 | 51c7b1964cb21 |
14 | 218d019d18d0a |
15 | dd2002d77a67 |
hex | 6d28617254ee |
120020201002222 has 8 divisors (see below), whose sum is σ = 180030362781672. Its totient is φ = 60010080075000.
The previous prime is 120020201002187. The next prime is 120020201002231. The reversal of 120020201002222 is 222200102020021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1200202010022222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120020201002196 and 120020201002205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1319304 + ... + 15549307.
It is an arithmetic number, because the mean of its divisors is an integer number (22503795347709).
Almost surely, 2120020201002222 is an apocalyptic number.
120020201002222 is a deficient number, since it is larger than the sum of its proper divisors (60010161779450).
120020201002222 is a wasteful number, since it uses less digits than its factorization.
120020201002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20426114.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 120020201002222 its reverse (222200102020021), we get a palindrome (342220303022243).
The spelling of 120020201002222 in words is "one hundred twenty trillion, twenty billion, two hundred one million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •