Base | Representation |
---|---|
bin | 110101000101100000… |
… | …1101001110011111101 |
3 | 101220020222011010201201 |
4 | 1222023001221303331 |
5 | 3331433403204000 |
6 | 124212134135501 |
7 | 11144031514525 |
oct | 1521301516375 |
9 | 356228133651 |
10 | 114001616125 |
11 | 44390a38581 |
12 | 1a116ab1591 |
13 | a99a5660b7 |
14 | 5736838685 |
15 | 2e7358b96a |
hex | 1a8b069cfd |
114001616125 has 16 divisors (see below), whose sum is σ = 145582721856. Its totient is φ = 89080328400.
The previous prime is 114001616111. The next prime is 114001616129. The reversal of 114001616125 is 521616100411.
It is not a de Polignac number, because 114001616125 - 25 = 114001616093 is a prime.
It is a super-2 number, since 2×1140016161252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114001616093 and 114001616102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114001616129) 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, 10599427 + ... + 10610176.
It is an arithmetic number, because the mean of its divisors is an integer number (9098920116).
Almost surely, 2114001616125 is an apocalyptic number.
It is an amenable number.
114001616125 is a deficient number, since it is larger than the sum of its proper divisors (31581105731).
114001616125 is an equidigital number, since it uses as much as digits as its factorization.
114001616125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21209661 (or 21209651 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 114001616125 its reverse (521616100411), we get a palindrome (635617716536).
The spelling of 114001616125 in words is "one hundred fourteen billion, one million, six hundred sixteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •