Base | Representation |
---|---|
bin | 11011010100010101… |
… | …00100000101110101 |
3 | 1101212002202211201020 |
4 | 31222022210011311 |
5 | 220014002243203 |
6 | 10423144251353 |
7 | 1026303263625 |
oct | 155212440565 |
9 | 41762684636 |
10 | 14666056053 |
11 | 6246673a90 |
12 | 2a13770b59 |
13 | 14c95c509c |
14 | 9d1b36885 |
15 | 5ac84d153 |
hex | 36a2a4175 |
14666056053 has 128 divisors (see below), whose sum is σ = 24403230720. Its totient is φ = 7727892480.
The previous prime is 14666056051. The next prime is 14666056063. The reversal of 14666056053 is 35065066641.
It is not a de Polignac number, because 14666056053 - 21 = 14666056051 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14666055996 and 14666056014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14666056051) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 41546725 + ... + 41547077.
It is an arithmetic number, because the mean of its divisors is an integer number (190650240).
Almost surely, 214666056053 is an apocalyptic number.
It is an amenable number.
14666056053 is a deficient number, since it is larger than the sum of its proper divisors (9737174667).
14666056053 is a wasteful number, since it uses less digits than its factorization.
14666056053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 519.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 14666056053 in words is "fourteen billion, six hundred sixty-six million, fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •