Base | Representation |
---|---|
bin | 110101001101101010… |
… | …0111101000011010000 |
3 | 101220222000210010022222 |
4 | 1222123110331003100 |
5 | 3333013412023440 |
6 | 124255224120212 |
7 | 11153562263162 |
oct | 1523324750320 |
9 | 356860703288 |
10 | 114275111120 |
11 | 445113593a5 |
12 | 1a192606068 |
13 | aa12113961 |
14 | 5760cac932 |
15 | 2e8c5b22b5 |
hex | 1a9b53d0d0 |
114275111120 has 40 divisors (see below), whose sum is σ = 281318438664. Its totient is φ = 43021217792.
The previous prime is 114275111107. The next prime is 114275111141. The reversal of 114275111120 is 21111572411.
It can be written as a sum of positive squares in 4 ways, for example, as 19241018944 + 95034092176 = 138712^2 + 308276^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 114275111120.
It is a congruent number.
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, 42011549 + ... + 42014268.
Almost surely, 2114275111120 is an apocalyptic number.
114275111120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114275111120 is an abundant number, since it is smaller than the sum of its proper divisors (167043327544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114275111120 is a wasteful number, since it uses less digits than its factorization.
114275111120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84025847 (or 84025841 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 26.
Adding to 114275111120 its reverse (21111572411), we get a palindrome (135386683531).
The spelling of 114275111120 in words is "one hundred fourteen billion, two hundred seventy-five million, one hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •