Base | Representation |
---|---|
bin | 1001100110011000101010… |
… | …10000111001101111110010 |
3 | 2202202002220121222222001120 |
4 | 10303030111100321233302 |
5 | 10231332011434342320 |
6 | 112521504500043110 |
7 | 4306104322646436 |
oct | 463142520715762 |
9 | 82662817888046 |
10 | 21110121012210 |
11 | 67a982aa7632a |
12 | 244b348993496 |
13 | ba18a2b69019 |
14 | 52da419889c6 |
15 | 2691c914a440 |
hex | 133315439bf2 |
21110121012210 has 32 divisors (see below), whose sum is σ = 50668721111232. Its totient is φ = 5628873305280.
The previous prime is 21110121012191. The next prime is 21110121012241. The reversal of 21110121012210 is 1221012101112.
It is a happy number.
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 21110121012210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30419796 + ... + 31106015.
It is an arithmetic number, because the mean of its divisors is an integer number (1583397534726).
Almost surely, 221110121012210 is an apocalyptic number.
21110121012210 is an abundant number, since it is smaller than the sum of its proper divisors (29558600099022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110121012210 is a wasteful number, since it uses less digits than its factorization.
21110121012210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61537258.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21110121012210 its reverse (1221012101112), we get a palindrome (22331133113322).
The spelling of 21110121012210 in words is "twenty-one trillion, one hundred ten billion, one hundred twenty-one million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •