Base | Representation |
---|---|
bin | 10000001011101000010… |
… | …111110100110101010101 |
3 | 10221022021012102010201000 |
4 | 100023220113310311111 |
5 | 121204334012402242 |
6 | 2210502405453513 |
7 | 143224254040356 |
oct | 20135027646525 |
9 | 3838235363630 |
10 | 1112000122197 |
11 | 399662096458 |
12 | 15b61a711299 |
13 | 80b26c835b3 |
14 | 3bb6d117d2d |
15 | 1ddd4247a4c |
hex | 102e85f4d55 |
1112000122197 has 16 divisors (see below), whose sum is σ = 1647443640960. Its totient is φ = 741317191200.
The previous prime is 1112000122153. The next prime is 1112000122267. The reversal of 1112000122197 is 7912210002111.
It is not a de Polignac number, because 1112000122197 - 26 = 1112000122133 is a prime.
It is a super-2 number, since 2×11120001221972 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 1112000122197.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112000124197) 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, 877072 + ... + 1730102.
It is an arithmetic number, because the mean of its divisors is an integer number (102965227560).
Almost surely, 21112000122197 is an apocalyptic number.
It is an amenable number.
1112000122197 is a deficient number, since it is larger than the sum of its proper divisors (535443518763).
1112000122197 is an equidigital number, since it uses as much as digits as its factorization.
1112000122197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 901321 (or 901315 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 27.
The spelling of 1112000122197 in words is "one trillion, one hundred twelve billion, one hundred twenty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •