Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …100000100110000100000 |
3 | 10222021100011012222210221 |
4 | 100111002130010300200 |
5 | 121341030341320112 |
6 | 2215253001132424 |
7 | 144032466101554 |
oct | 20250234046040 |
9 | 3867304188727 |
10 | 1122101120032 |
11 | 3a2975913652 |
12 | 16157948a114 |
13 | 81a768737a9 |
14 | 3c44a84b864 |
15 | 1e2c5e05e07 |
hex | 10542704c20 |
1122101120032 has 12 divisors (see below), whose sum is σ = 2209136580126. Its totient is φ = 561050560000.
The previous prime is 1122101120027. The next prime is 1122101120033. The reversal of 1122101120032 is 2300211012211.
It can be written as a sum of positive squares in only one way, i.e., 1047355747216 + 74745372816 = 1023404^2 + 273396^2 .
It is a super-2 number, since 2×11221011200322 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 1122101119988 and 1122101120015.
It is not an unprimeable number, because it can be changed into a prime (1122101120033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17532829969 + ... + 17532830032.
Almost surely, 21122101120032 is an apocalyptic number.
It is an amenable number.
1122101120032 is a deficient number, since it is larger than the sum of its proper divisors (1087035460094).
1122101120032 is an equidigital number, since it uses as much as digits as its factorization.
1122101120032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35065660011 (or 35065660003 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1122101120032 its reverse (2300211012211), we get a palindrome (3422312132243).
The spelling of 1122101120032 in words is "one trillion, one hundred twenty-two billion, one hundred one million, one hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •