Base | Representation |
---|---|
bin | 110011110010000011… |
… | …1001011101000000000 |
3 | 101122000210210211101122 |
4 | 1213210013023220000 |
5 | 3310220011122042 |
6 | 123030221051412 |
7 | 11014446126101 |
oct | 1474407135000 |
9 | 348023724348 |
10 | 111201270272 |
11 | 43184244264 |
12 | 196750b6b68 |
13 | a642347611 |
14 | 554c9643a8 |
15 | 2d5c7d47d2 |
hex | 19e41cba00 |
111201270272 has 80 divisors (see below), whose sum is σ = 223367344200. Its totient is φ = 55305830400.
The previous prime is 111201270259. The next prime is 111201270277. The reversal of 111201270272 is 272072102111.
It can be written as a sum of positive squares in 4 ways, for example, as 68593705216 + 42607565056 = 261904^2 + 206416^2 .
It is not an unprimeable number, because it can be changed into a prime (111201270277) 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, 119699504 + ... + 119700432.
Almost surely, 2111201270272 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 111201270272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111683672100).
111201270272 is an abundant number, since it is smaller than the sum of its proper divisors (112166073928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201270272 is an frugal number, since it uses more digits than its factorization.
111201270272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1937 (or 1921 counting only the distinct ones).
The product of its (nonzero) digits is 784, while the sum is 26.
Adding to 111201270272 its reverse (272072102111), we get a palindrome (383273372383).
The spelling of 111201270272 in words is "one hundred eleven billion, two hundred one million, two hundred seventy thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •