Base | Representation |
---|---|
bin | 10001011110100111110… |
… | …111000101100001011000 |
3 | 11020211021120100012201212 |
4 | 101132213313011201120 |
5 | 124134334200024232 |
6 | 2315441105002252 |
7 | 152530451330510 |
oct | 21364767054130 |
9 | 4224246305655 |
10 | 1201112111192 |
11 | 423430523754 |
12 | 17494a023388 |
13 | 89358b19176 |
14 | 421c40da840 |
15 | 2139c664eb2 |
hex | 117a7dc5858 |
1201112111192 has 128 divisors (see below), whose sum is σ = 2737706895360. Its totient is φ = 482858787840.
The previous prime is 1201112111191. The next prime is 1201112111209. The reversal of 1201112111192 is 2911112111021.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201112111191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 250594748 + ... + 250599540.
It is an arithmetic number, because the mean of its divisors is an integer number (21388335120).
Almost surely, 21201112111192 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1201112111192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1368853447680).
1201112111192 is an abundant number, since it is smaller than the sum of its proper divisors (1536594784168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201112111192 is a wasteful number, since it uses less digits than its factorization.
1201112111192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8553 (or 8549 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 1201112111192 in words is "one trillion, two hundred one billion, one hundred twelve million, one hundred eleven thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •