Base | Representation |
---|---|
bin | 1001100110101110110111… |
… | …01100001111001001010110 |
3 | 2202210020200021200100001220 |
4 | 10303113123230033021112 |
5 | 10232030414220013420 |
6 | 112531155313231210 |
7 | 4310005561456266 |
oct | 463273354171126 |
9 | 82706607610056 |
10 | 21122040001110 |
11 | 6803896a26084 |
12 | 2451714562506 |
13 | ba2a522a8189 |
14 | 5304529197a6 |
15 | 269675717840 |
hex | 1335dbb0f256 |
21122040001110 has 32 divisors (see below), whose sum is σ = 51028610556672. Its totient is φ = 5595242383200.
The previous prime is 21122040001109. The next prime is 21122040001123. The reversal of 21122040001110 is 1110004022112.
It is a super-2 number, since 2×211220400011102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 21122040001110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2331346464 + ... + 2331355523.
It is an arithmetic number, because the mean of its divisors is an integer number (1594644079896).
Almost surely, 221122040001110 is an apocalyptic number.
21122040001110 is an abundant number, since it is smaller than the sum of its proper divisors (29906570555562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21122040001110 is a wasteful number, since it uses less digits than its factorization.
21122040001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4662702148.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21122040001110 its reverse (1110004022112), we get a palindrome (22232044023222).
The spelling of 21122040001110 in words is "twenty-one trillion, one hundred twenty-two billion, forty million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •