Base | Representation |
---|---|
bin | 11110111000010111000… |
… | …100111011001100010100 |
3 | 21111212111212102220000220 |
4 | 132320113010323030110 |
5 | 234232030324324340 |
6 | 4302514005234340 |
7 | 306213432655431 |
oct | 36702704731424 |
9 | 7455455386026 |
10 | 2122101011220 |
11 | 748a83774813 |
12 | 2a333b4029b0 |
13 | 125161b01938 |
14 | 749d2c66b88 |
15 | 3a302649ed0 |
hex | 1ee1713b314 |
2122101011220 has 48 divisors (see below), whose sum is σ = 5942192514048. Its totient is φ = 565864109440.
The previous prime is 2122101011203. The next prime is 2122101011263. The reversal of 2122101011220 is 221101012212.
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 2122101011220.
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, 251482 + ... + 2075438.
It is an arithmetic number, because the mean of its divisors is an integer number (123795677376).
Almost surely, 22122101011220 is an apocalyptic number.
2122101011220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2122101011220 is an abundant number, since it is smaller than the sum of its proper divisors (3820091502828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2122101011220 is a wasteful number, since it uses less digits than its factorization.
2122101011220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1843360 (or 1843358 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2122101011220 its reverse (221101012212), we get a palindrome (2343202023432).
The spelling of 2122101011220 in words is "two trillion, one hundred twenty-two billion, one hundred one million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •