Base | Representation |
---|---|
bin | 10011110111011100… |
… | …100100101110110110 |
3 | 2001001121122221110011 |
4 | 103313130210232312 |
5 | 322141310111042 |
6 | 13444404250434 |
7 | 1353416221240 |
oct | 236734445666 |
9 | 61047587404 |
10 | 21331332022 |
11 | 9056a87520 |
12 | 41739a0a1a |
13 | 201c462c70 |
14 | 1065041090 |
15 | 84ca99a17 |
hex | 4f7724bb6 |
21331332022 has 32 divisors (see below), whose sum is σ = 42961008384. Its totient is φ = 7671607200.
The previous prime is 21331331999. The next prime is 21331332023. The reversal of 21331332022 is 22023313312.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 21331331984 and 21331332002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21331332023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5325504 + ... + 5329507.
It is an arithmetic number, because the mean of its divisors is an integer number (1342531512).
Almost surely, 221331332022 is an apocalyptic number.
21331332022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21331332022 is an abundant number, since it is smaller than the sum of its proper divisors (21629676362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21331332022 is a wasteful number, since it uses less digits than its factorization.
21331332022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10655044.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 21331332022 its reverse (22023313312), we get a palindrome (43354645334).
It can be divided in two parts, 21331 and 332022, that added together give a palindrome (353353).
The spelling of 21331332022 in words is "twenty-one billion, three hundred thirty-one million, three hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •