Base | Representation |
---|---|
bin | 11011001001001100… |
… | …10011110110000101 |
3 | 1101121121001010222110 |
4 | 31210212103312011 |
5 | 214321100304440 |
6 | 10410010451233 |
7 | 1024060422264 |
oct | 154446236605 |
9 | 41547033873 |
10 | 14572666245 |
11 | 61a8987925 |
12 | 29a8433b19 |
13 | 14b3157247 |
14 | 9c35865db |
15 | 5a4552080 |
hex | 364993d85 |
14572666245 has 64 divisors (see below), whose sum is σ = 24338730240. Its totient is φ = 7439910912.
The previous prime is 14572666219. The next prime is 14572666249. The reversal of 14572666245 is 54266627541.
14572666245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14572666245 - 212 = 14572662149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14572666194 and 14572666203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14572666249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8144811 + ... + 8146599.
It is an arithmetic number, because the mean of its divisors is an integer number (380292660).
Almost surely, 214572666245 is an apocalyptic number.
14572666245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14572666245 is a deficient number, since it is larger than the sum of its proper divisors (9766063995).
14572666245 is a wasteful number, since it uses less digits than its factorization.
14572666245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2086.
The product of its digits is 2419200, while the sum is 48.
The spelling of 14572666245 in words is "fourteen billion, five hundred seventy-two million, six hundred sixty-six thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •