Base | Representation |
---|---|
bin | 11101001000101110111… |
… | …10000000011101001000 |
3 | 10112201001212000022220112 |
4 | 32210113132000131020 |
5 | 112400244001401440 |
6 | 2043524140013452 |
7 | 132220500063440 |
oct | 16442736003510 |
9 | 3481055008815 |
10 | 1001121122120 |
11 | 3566338575a9 |
12 | 142035531288 |
13 | 73536633602 |
14 | 366512c3120 |
15 | 1b094dc0965 |
hex | e917780748 |
1001121122120 has 32 divisors (see below), whose sum is σ = 2574311457600. Its totient is φ = 343241527488.
The previous prime is 1001121122101. The next prime is 1001121122137. The reversal of 1001121122120 is 212211211001.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1001121122095 and 1001121122104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1787716010 + ... + 1787716569.
It is an arithmetic number, because the mean of its divisors is an integer number (80447233050).
Almost surely, 21001121122120 is an apocalyptic number.
1001121122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001121122120 is an abundant number, since it is smaller than the sum of its proper divisors (1573190335480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001121122120 is a wasteful number, since it uses less digits than its factorization.
1001121122120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3575432597 (or 3575432593 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1001121122120 its reverse (212211211001), we get a palindrome (1213332333121).
The spelling of 1001121122120 in words is "one trillion, one billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •