Base | Representation |
---|---|
bin | 1001101001100101100001… |
… | …00101101011110110101010 |
3 | 2210010121210022221212101120 |
4 | 10310302300211223312222 |
5 | 10240132231341024320 |
6 | 113044214015200110 |
7 | 4320046613242461 |
oct | 464626045536652 |
9 | 83117708855346 |
10 | 21220101111210 |
11 | 6841437963531 |
12 | 2468720b16036 |
13 | bac07c1b8891 |
14 | 5350b626b9d8 |
15 | 26beb4611440 |
hex | 134cb096bdaa |
21220101111210 has 16 divisors (see below), whose sum is σ = 50928242666976. Its totient is φ = 5658693629648.
The previous prime is 21220101111203. The next prime is 21220101111257. The reversal of 21220101111210 is 1211110102212.
It is a happy number.
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 21220101111210.
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 7 ways as a sum of consecutive naturals, for example, 353668351824 + ... + 353668351883.
It is an arithmetic number, because the mean of its divisors is an integer number (3183015166686).
Almost surely, 221220101111210 is an apocalyptic number.
21220101111210 is an abundant number, since it is smaller than the sum of its proper divisors (29708141555766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21220101111210 is a wasteful number, since it uses less digits than its factorization.
21220101111210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707336703717.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21220101111210 its reverse (1211110102212), we get a palindrome (22431211213422).
The spelling of 21220101111210 in words is "twenty-one trillion, two hundred twenty billion, one hundred one million, one hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •