Base | Representation |
---|---|
bin | 1100110101011111000001… |
… | …0110100011010101100110 |
3 | 1211222012010020101021201012 |
4 | 3031113300112203111212 |
5 | 3322211411000323420 |
6 | 50003231145302222 |
7 | 2654426203531100 |
oct | 315276026432546 |
9 | 54865106337635 |
10 | 14113000011110 |
11 | 4551320643520 |
12 | 16bb23b194972 |
13 | 7b4b08b3a450 |
14 | 36b103c5c570 |
15 | 1971a158cdc5 |
hex | cd5f05a3566 |
14113000011110 has 96 divisors (see below), whose sum is σ = 34717134265632. Its totient is φ = 4060483499520.
The previous prime is 14113000011109. The next prime is 14113000011157. The reversal of 14113000011110 is 1111000031141.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 100636367 + ... + 100776506.
It is an arithmetic number, because the mean of its divisors is an integer number (361636815267).
Almost surely, 214113000011110 is an apocalyptic number.
14113000011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14113000011110 is an abundant number, since it is smaller than the sum of its proper divisors (20604134254522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14113000011110 is a wasteful number, since it uses less digits than its factorization.
14113000011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201412918 (or 201412911 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 14113000011110 its reverse (1111000031141), we get a palindrome (15224000042251).
The spelling of 14113000011110 in words is "fourteen trillion, one hundred thirteen billion, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •