Base | Representation |
---|---|
bin | 11011111000010010… |
… | …01110011011001101 |
3 | 1102122010100200122001 |
4 | 31330021032123031 |
5 | 221123212220203 |
6 | 10513121352301 |
7 | 1036625210623 |
oct | 157411163315 |
9 | 42563320561 |
10 | 14967695053 |
11 | 6390967913 |
12 | 2a98798691 |
13 | 1546c47bbc |
14 | a1dc15513 |
15 | 5c908291d |
hex | 37c24e6cd |
14967695053 has 8 divisors (see below), whose sum is σ = 15342195960. Its totient is φ = 14593643520.
The previous prime is 14967695023. The next prime is 14967695117. The reversal of 14967695053 is 35059676941.
It can be written as a sum of positive squares in 4 ways, for example, as 410548644 + 14557146409 = 20262^2 + 120653^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14967695053 - 225 = 14934140621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14967694985 and 14967695003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14967695023) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 44388 + ... + 178621.
It is an arithmetic number, because the mean of its divisors is an integer number (1917774495).
Almost surely, 214967695053 is an apocalyptic number.
It is an amenable number.
14967695053 is a deficient number, since it is larger than the sum of its proper divisors (374500907).
14967695053 is a wasteful number, since it uses less digits than its factorization.
14967695053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224687.
The product of its (nonzero) digits is 6123600, while the sum is 55.
The spelling of 14967695053 in words is "fourteen billion, nine hundred sixty-seven million, six hundred ninety-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •