Base | Representation |
---|---|
bin | 1101000001101000… |
… | …0000110011001011 |
3 | 100000200020120210022 |
4 | 3100122000303023 |
5 | 24130044324242 |
6 | 1334541411055 |
7 | 152434406042 |
oct | 32032006313 |
9 | 10020216708 |
10 | 3496479947 |
11 | 1534743154 |
12 | 816b69a8b |
13 | 43950635c |
14 | 252523559 |
15 | 156e640d2 |
hex | d0680ccb |
3496479947 has 8 divisors (see below), whose sum is σ = 3703088736. Its totient is φ = 3289974912.
The previous prime is 3496479929. The next prime is 3496479967. The reversal of 3496479947 is 7499746943.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3496479947 - 28 = 3496479691 is a prime.
It is a super-3 number, since 3×34964799473 (a number of 30 digits) contains 333 as substring.
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 3496479947.
It is not an unprimeable number, because it can be changed into a prime (3496479967) 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, 49793 + ... + 97325.
It is an arithmetic number, because the mean of its divisors is an integer number (462886092).
Almost surely, 23496479947 is an apocalyptic number.
3496479947 is a deficient number, since it is larger than the sum of its proper divisors (206608789).
3496479947 is a wasteful number, since it uses less digits than its factorization.
3496479947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51877.
The product of its digits is 41150592, while the sum is 62.
The square root of 3496479947 is about 59131.0404694523. The cubic root of 3496479947 is about 1517.7853173891.
The spelling of 3496479947 in words is "three billion, four hundred ninety-six million, four hundred seventy-nine thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •