Base | Representation |
---|---|
bin | 10001100110111010110… |
… | …111111000100110101010 |
3 | 11021200021110000210000221 |
4 | 101212322313320212222 |
5 | 124311110340201442 |
6 | 2323513113520254 |
7 | 153264306661663 |
oct | 21467267704652 |
9 | 4250243023027 |
10 | 1210021022122 |
11 | 42719235a360 |
12 | 17661571308a |
13 | 8a1487558b3 |
14 | 427cb3a036a |
15 | 2171e84c467 |
hex | 119badf89aa |
1210021022122 has 8 divisors (see below), whose sum is σ = 1980034399872. Its totient is φ = 550009555500.
The previous prime is 1210021022113. The next prime is 1210021022123. The reversal of 1210021022122 is 2212201200121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12100210221222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210021022096 and 1210021022105.
It is not an unprimeable number, because it can be changed into a prime (1210021022123) by changing a digit.
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, 27500477754 + ... + 27500477797.
It is an arithmetic number, because the mean of its divisors is an integer number (247504299984).
Almost surely, 21210021022122 is an apocalyptic number.
1210021022122 is a deficient number, since it is larger than the sum of its proper divisors (770013377750).
1210021022122 is a wasteful number, since it uses less digits than its factorization.
1210021022122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55000955564.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1210021022122 its reverse (2212201200121), we get a palindrome (3422222222243).
The spelling of 1210021022122 in words is "one trillion, two hundred ten billion, twenty-one million, twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •