Base | Representation |
---|---|
bin | 1001001100100010101011… |
… | …01101111000110101011010 |
3 | 2122121012212222211011010022 |
4 | 10212101111231320311122 |
5 | 10122304422343402302 |
6 | 111001531425350442 |
7 | 4155000403633631 |
oct | 446212555706532 |
9 | 78535788734108 |
10 | 20222144122202 |
11 | 6497188191a80 |
12 | 232722b198422 |
13 | b38c2b2765a9 |
14 | 4dca852b8518 |
15 | 2510574068a2 |
hex | 126455b78d5a |
20222144122202 has 8 divisors (see below), whose sum is σ = 33090781290912. Its totient is φ = 9191883691900.
The previous prime is 20222144122181. The next prime is 20222144122261.
20222144122202 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×202221441222022 (a number of 27 digits) contains 22 as substring.
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, 459594184574 + ... + 459594184617.
It is an arithmetic number, because the mean of its divisors is an integer number (4136347661364).
Almost surely, 220222144122202 is an apocalyptic number.
20222144122202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20222144122202 is a deficient number, since it is larger than the sum of its proper divisors (12868637168710).
20222144122202 is a wasteful number, since it uses less digits than its factorization.
20222144122202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919188369204.
The product of its (nonzero) digits is 4096, while the sum is 26.
It can be divided in two parts, 2022214 and 4122202, that added together give a palindrome (6144416).
The spelling of 20222144122202 in words is "twenty trillion, two hundred twenty-two billion, one hundred forty-four million, one hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •