Base | Representation |
---|---|
bin | 110010100010101101101… |
… | …101010000110110110001 |
3 | 110022001001121200110020012 |
4 | 302202231231100312301 |
5 | 423401202430232212 |
6 | 11215331004224305 |
7 | 505635215012156 |
oct | 62425555206661 |
9 | 13261047613205 |
10 | 3473247899057 |
11 | 1119aa5989842 |
12 | 48117b83b095 |
13 | 1c26ab455441 |
14 | c016b1a822d |
15 | 6053195d922 |
hex | 328adb50db1 |
3473247899057 has 12 divisors (see below), whose sum is σ = 3786468407280. Its totient is φ = 3176981729712.
The previous prime is 3473247899021. The next prime is 3473247899119. The reversal of 3473247899057 is 7509987423743.
3473247899057 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 3473247899057 - 26 = 3473247898993 is a prime.
It is a super-2 number, since 2×34732478990572 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3473247899557) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 108665663 + ... + 108697620.
It is an arithmetic number, because the mean of its divisors is an integer number (315539033940).
Almost surely, 23473247899057 is an apocalyptic number.
It is an amenable number.
3473247899057 is a deficient number, since it is larger than the sum of its proper divisors (313220508223).
3473247899057 is a wasteful number, since it uses less digits than its factorization.
3473247899057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217363360 (or 217363331 counting only the distinct ones).
The product of its (nonzero) digits is 320060160, while the sum is 68.
The spelling of 3473247899057 in words is "three trillion, four hundred seventy-three billion, two hundred forty-seven million, eight hundred ninety-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •