Base | Representation |
---|---|
bin | 1101001010000001111001… |
… | …0010101110111010011001 |
3 | 1220012221011111020221221212 |
4 | 3102200132102232322121 |
5 | 3344002240232031103 |
6 | 50433322553512505 |
7 | 3022062632602256 |
oct | 322403622567231 |
9 | 56187144227855 |
10 | 14465958080153 |
11 | 4677a84233928 |
12 | 1757724112735 |
13 | 80c1984cb888 |
14 | 38022850042d |
15 | 1a145d1517d8 |
hex | d281e4aee99 |
14465958080153 has 16 divisors (see below), whose sum is σ = 15100967851200. Its totient is φ = 13846242876480.
The previous prime is 14465958080129. The next prime is 14465958080173. The reversal of 14465958080153 is 35108085956441.
14465958080153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 14465958080153 - 28 = 14465958079897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14465958080092 and 14465958080101.
It is not an unprimeable number, because it can be changed into a prime (14465958080113) 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, 9545423 + ... + 10956596.
It is an arithmetic number, because the mean of its divisors is an integer number (943810490700).
Almost surely, 214465958080153 is an apocalyptic number.
It is an amenable number.
14465958080153 is a deficient number, since it is larger than the sum of its proper divisors (635009771047).
14465958080153 is a wasteful number, since it uses less digits than its factorization.
14465958080153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20502392.
The product of its (nonzero) digits is 20736000, while the sum is 59.
The spelling of 14465958080153 in words is "fourteen trillion, four hundred sixty-five billion, nine hundred fifty-eight million, eighty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •