Base | Representation |
---|---|
bin | 10100100010011101… |
… | …111110110000010001 |
3 | 2002220220211121211210 |
4 | 110202131332300101 |
5 | 330131044333131 |
6 | 14044150530333 |
7 | 1410332302350 |
oct | 244235766021 |
9 | 62826747753 |
10 | 22053121041 |
11 | 9397459276 |
12 | 43356669a9 |
13 | 2105b60b63 |
14 | 10d2c4b997 |
15 | 891123146 |
hex | 52277ec11 |
22053121041 has 16 divisors (see below), whose sum is σ = 34424385408. Its totient is φ = 12294422400.
The previous prime is 22053121007. The next prime is 22053121127. The reversal of 22053121041 is 14012135022.
It is not a de Polignac number, because 22053121041 - 210 = 22053120017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 22053120999 and 22053121017.
It is not an unprimeable number, because it can be changed into a prime (22053101041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12805830 + ... + 12807551.
It is an arithmetic number, because the mean of its divisors is an integer number (2151524088).
Almost surely, 222053121041 is an apocalyptic number.
22053121041 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
22053121041 is a deficient number, since it is larger than the sum of its proper divisors (12371264367).
22053121041 is a wasteful number, since it uses less digits than its factorization.
22053121041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25613432.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 22053121041 its reverse (14012135022), we get a palindrome (36065256063).
The spelling of 22053121041 in words is "twenty-two billion, fifty-three million, one hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •