Base | Representation |
---|---|
bin | 1100110101011111011001… |
… | …0100000100000101101101 |
3 | 1211222012101012120101000212 |
4 | 3031113312110010011231 |
5 | 3322212112101202000 |
6 | 50003245121032205 |
7 | 2654431526600306 |
oct | 315276624040555 |
9 | 54865335511025 |
10 | 14113100022125 |
11 | 4551372042255 |
12 | 16bb268785665 |
13 | 7b4b23785c70 |
14 | 36b1132537ad |
15 | 1971aa245c35 |
hex | cd5f650416d |
14113100022125 has 32 divisors (see below), whose sum is σ = 19371581139456. Its totient is φ = 10200237211200.
The previous prime is 14113100022113. The next prime is 14113100022167. The reversal of 14113100022125 is 52122000131141.
14113100022125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14113100022125 - 210 = 14113100021101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14113100022125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92317079 + ... + 92469828.
It is an arithmetic number, because the mean of its divisors is an integer number (605361910608).
Almost surely, 214113100022125 is an apocalyptic number.
It is an amenable number.
14113100022125 is a deficient number, since it is larger than the sum of its proper divisors (5258481117331).
14113100022125 is a wasteful number, since it uses less digits than its factorization.
14113100022125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184786982 (or 184786972 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 14113100022125 its reverse (52122000131141), we get a palindrome (66235100153266).
The spelling of 14113100022125 in words is "fourteen trillion, one hundred thirteen billion, one hundred million, twenty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •