Base | Representation |
---|---|
bin | 10100011111111010… |
… | …010010011101001001 |
3 | 2002210221002112010110 |
4 | 110133322102131021 |
5 | 330034103210441 |
6 | 14040015104533 |
7 | 1406301461544 |
oct | 243772223511 |
9 | 62727075113 |
10 | 22010210121 |
11 | 937520a6a9 |
12 | 4323212149 |
13 | 20c9cb8393 |
14 | 10cb27b85b |
15 | 88c498b16 |
hex | 51fe92749 |
22010210121 has 8 divisors (see below), whose sum is σ = 29971350144. Its totient is φ = 14361271760.
The previous prime is 22010210041. The next prime is 22010210141. The reversal of 22010210121 is 12101201022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22010210121 - 29 = 22010209609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22010210097 and 22010210106.
It is not an unprimeable number, because it can be changed into a prime (22010210141) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 78050250 + ... + 78050531.
It is an arithmetic number, because the mean of its divisors is an integer number (3746418768).
Almost surely, 222010210121 is an apocalyptic number.
It is an amenable number.
22010210121 is a deficient number, since it is larger than the sum of its proper divisors (7961140023).
22010210121 is a wasteful number, since it uses less digits than its factorization.
22010210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156100831.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22010210121 its reverse (12101201022), we get a palindrome (34111411143).
Subtracting from 22010210121 its reverse (12101201022), we obtain a palindrome (9909009099).
The spelling of 22010210121 in words is "twenty-two billion, ten million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •