Base | Representation |
---|---|
bin | 11101001000101111000… |
… | …01011001010000000000 |
3 | 10112201001220200110000010 |
4 | 32210113201121100000 |
5 | 112400244213310422 |
6 | 2043524211024520 |
7 | 132220510452360 |
oct | 16442741312000 |
9 | 3481056613003 |
10 | 1001122010112 |
11 | 356634303784 |
12 | 14203589b140 |
13 | 73536884853 |
14 | 366514749a0 |
15 | 1b094ee8b0c |
hex | e917859400 |
1001122010112 has 88 divisors (see below), whose sum is σ = 3049548807616. Its totient is φ = 286034853888.
The previous prime is 1001122010111. The next prime is 1001122010113. The reversal of 1001122010112 is 2110102211001.
It is an interprime number because it is at equal distance from previous prime (1001122010111) and next prime (1001122010113).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001122010111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23256073 + ... + 23299080.
Almost surely, 21001122010112 is an apocalyptic number.
1001122010112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1001122010112 is an abundant number, since it is smaller than the sum of its proper divisors (2048426797504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001122010112 is an equidigital number, since it uses as much as digits as its factorization.
1001122010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46555183 (or 46555165 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1001122010112 its reverse (2110102211001), we get a palindrome (3111224221113).
The spelling of 1001122010112 in words is "one trillion, one billion, one hundred twenty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •