Base | Representation |
---|---|
bin | 11011101010101000… |
… | …01000111100111101 |
3 | 1102100010202110022122 |
4 | 31311110020330331 |
5 | 220404344200314 |
6 | 10453505452325 |
7 | 1034034254225 |
oct | 156524107475 |
9 | 42303673278 |
10 | 14853115709 |
11 | 6332218743 |
12 | 2a663410a5 |
13 | 152929b383 |
14 | a0c90b085 |
15 | 5bde9d28e |
hex | 375508f3d |
14853115709 has 4 divisors (see below), whose sum is σ = 14970069504. Its totient is φ = 14736161916.
The previous prime is 14853115699. The next prime is 14853115787. The reversal of 14853115709 is 90751135841.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14853115709 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 14853115709.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14853111709) 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 3 ways as a sum of consecutive naturals, for example, 58476707 + ... + 58476960.
It is an arithmetic number, because the mean of its divisors is an integer number (3742517376).
Almost surely, 214853115709 is an apocalyptic number.
It is an amenable number.
14853115709 is a deficient number, since it is larger than the sum of its proper divisors (116953795).
14853115709 is a wasteful number, since it uses less digits than its factorization.
14853115709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116953794.
The product of its (nonzero) digits is 151200, while the sum is 44.
The spelling of 14853115709 in words is "fourteen billion, eight hundred fifty-three million, one hundred fifteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •