Base | Representation |
---|---|
bin | 11010011000000100… |
… | …10100001000011011 |
3 | 1100112212121211212201 |
4 | 31030002110020123 |
5 | 213000101431201 |
6 | 10301050151031 |
7 | 1010624630125 |
oct | 151402241033 |
9 | 40485554781 |
10 | 14160577051 |
11 | 6007305145 |
12 | 28b2422477 |
13 | 144897219a |
14 | 984956215 |
15 | 57d2a1801 |
hex | 34c09421b |
14160577051 has 8 divisors (see below), whose sum is σ = 14989147200. Its totient is φ = 13340334600.
The previous prime is 14160577043. The next prime is 14160577061. The reversal of 14160577051 is 15077506141.
It is a happy number.
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 14160577051 - 23 = 14160577043 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14160577051.
It is not an unprimeable number, because it can be changed into a prime (14160577061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2078425 + ... + 2085226.
It is an arithmetic number, because the mean of its divisors is an integer number (1873643400).
Almost surely, 214160577051 is an apocalyptic number.
14160577051 is a deficient number, since it is larger than the sum of its proper divisors (828570149).
14160577051 is a wasteful number, since it uses less digits than its factorization.
14160577051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4163849.
The product of its (nonzero) digits is 29400, while the sum is 37.
The spelling of 14160577051 in words is "fourteen billion, one hundred sixty million, five hundred seventy-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •