Base | Representation |
---|---|
bin | 11010110101001110… |
… | …10110111010001010 |
3 | 1101011220212101122120 |
4 | 31122213112322022 |
5 | 214000210400103 |
6 | 10341224432110 |
7 | 1016654625420 |
oct | 153247267212 |
9 | 41156771576 |
10 | 14405168778 |
11 | 6122384570 |
12 | 2960318636 |
13 | 1487540010 |
14 | 9a9225110 |
15 | 5949b8253 |
hex | 35a9d6e8a |
14405168778 has 128 divisors (see below), whose sum is σ = 40364642304. Its totient is φ = 3303590400.
The previous prime is 14405168759. The next prime is 14405168797. The reversal of 14405168778 is 87786150441.
It is an interprime number because it is at equal distance from previous prime (14405168759) and next prime (14405168797).
It is a self number, because there is not a number n which added to its sum of digits gives 14405168778.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 85998 + ... + 190278.
It is an arithmetic number, because the mean of its divisors is an integer number (315348768).
Almost surely, 214405168778 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14405168778, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20182321152).
14405168778 is an abundant number, since it is smaller than the sum of its proper divisors (25959473526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14405168778 is a wasteful number, since it uses less digits than its factorization.
14405168778 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104340.
The product of its (nonzero) digits is 1505280, while the sum is 51.
The spelling of 14405168778 in words is "fourteen billion, four hundred five million, one hundred sixty-eight thousand, seven hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •