Base | Representation |
---|---|
bin | 11011001001011011… |
… | …01100101110010101 |
3 | 1101121201200112220221 |
4 | 31210231230232111 |
5 | 214322044300112 |
6 | 10410120154341 |
7 | 1024113040252 |
oct | 154455545625 |
9 | 41551615827 |
10 | 14574603157 |
11 | 61a9a90084 |
12 | 29a90089b1 |
13 | 14b3684a4a |
14 | 9c392c429 |
15 | 5a47d5e07 |
hex | 364b6cb95 |
14574603157 has 4 divisors (see below), whose sum is σ = 14703582060. Its totient is φ = 14445624256.
The previous prime is 14574603151. The next prime is 14574603209. The reversal of 14574603157 is 75130647541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75130647541 = 16249 ⋅4623709.
It can be written as a sum of positive squares in 2 ways, for example, as 363817476 + 14210785681 = 19074^2 + 119209^2 .
It is a cyclic number.
It is not a de Polignac number, because 14574603157 - 215 = 14574570389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14574603151) 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, 64489282 + ... + 64489507.
It is an arithmetic number, because the mean of its divisors is an integer number (3675895515).
Almost surely, 214574603157 is an apocalyptic number.
It is an amenable number.
14574603157 is a deficient number, since it is larger than the sum of its proper divisors (128978903).
14574603157 is a wasteful number, since it uses less digits than its factorization.
14574603157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128978902.
The product of its (nonzero) digits is 352800, while the sum is 43.
The spelling of 14574603157 in words is "fourteen billion, five hundred seventy-four million, six hundred three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •