Base | Representation |
---|---|
bin | 10011100000011010… |
… | …10010001011111011 |
3 | 1000000211210100110112 |
4 | 21300031102023323 |
5 | 132421422341042 |
6 | 4451101134535 |
7 | 520342325234 |
oct | 116015221373 |
9 | 30024710415 |
10 | 10472465147 |
11 | 4494485081 |
12 | 204325a44b |
13 | cab851651 |
14 | 714bcc08b |
15 | 4145d7982 |
hex | 2703522fb |
10472465147 has 8 divisors (see below), whose sum is σ = 10528896000. Its totient is φ = 10416072744.
The previous prime is 10472465111. The next prime is 10472465173. The reversal of 10472465147 is 74156427401.
10472465147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10472465147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10472465947) 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 7 ways as a sum of consecutive naturals, for example, 660608 + ... + 676274.
It is an arithmetic number, because the mean of its divisors is an integer number (1316112000).
Almost surely, 210472465147 is an apocalyptic number.
10472465147 is a deficient number, since it is larger than the sum of its proper divisors (56430853).
10472465147 is a wasteful number, since it uses less digits than its factorization.
10472465147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19225.
The product of its (nonzero) digits is 188160, while the sum is 41.
The spelling of 10472465147 in words is "ten billion, four hundred seventy-two million, four hundred sixty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •