Base | Representation |
---|---|
bin | 11101001000111010111… |
… | …11010000001111010010 |
3 | 10112201022220001011021020 |
4 | 32210131133100033102 |
5 | 112401000330042320 |
6 | 2043542144340310 |
7 | 132223134351255 |
oct | 16443537201722 |
9 | 3481286034236 |
10 | 1001222112210 |
11 | 356685864991 |
12 | 142063314696 |
13 | 73551532968 |
14 | 3666089109c |
15 | 1b09dbbd940 |
hex | e91d7d03d2 |
1001222112210 has 32 divisors (see below), whose sum is σ = 2403343757952. Its totient is φ = 266946931200.
The previous prime is 1001222112161. The next prime is 1001222112211. The reversal of 1001222112210 is 122112221001.
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 1001222112210.
It is not an unprimeable number, because it can be changed into a prime (1001222112211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2673366 + ... + 3024785.
It is an arithmetic number, because the mean of its divisors is an integer number (75104492436).
Almost surely, 21001222112210 is an apocalyptic number.
1001222112210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1001222112210 is an abundant number, since it is smaller than the sum of its proper divisors (1402121645742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001222112210 is a wasteful number, since it uses less digits than its factorization.
1001222112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5704018.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1001222112210 its reverse (122112221001), we get a palindrome (1123334333211).
The spelling of 1001222112210 in words is "one trillion, one billion, two hundred twenty-two million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •