Base | Representation |
---|---|
bin | 10011100101000001… |
… | …110100110011111110 |
3 | 2000021002020000111220 |
4 | 103211001310303332 |
5 | 321023204030420 |
6 | 13354005254210 |
7 | 1342644600105 |
oct | 234501646376 |
9 | 60232200456 |
10 | 21022330110 |
11 | 8a08614841 |
12 | 40a8404366 |
13 | 1ca04329b2 |
14 | 1035da703c |
15 | 8308ad840 |
hex | 4e5074cfe |
21022330110 has 32 divisors (see below), whose sum is σ = 50466931200. Its totient is φ = 5604472608.
The previous prime is 21022330097. The next prime is 21022330117. The reversal of 21022330110 is 1103322012.
It is a super-2 number, since 2×210223301102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 21022330110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21022330117) 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 15 ways as a sum of consecutive naturals, for example, 25191 + ... + 206589.
It is an arithmetic number, because the mean of its divisors is an integer number (1577091600).
Almost surely, 221022330110 is an apocalyptic number.
21022330110 is an abundant number, since it is smaller than the sum of its proper divisors (29444601090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21022330110 is a wasteful number, since it uses less digits than its factorization.
21022330110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185272.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 21022330110 its reverse (1103322012), we get a palindrome (22125652122).
The spelling of 21022330110 in words is "twenty-one billion, twenty-two million, three hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •