Base | Representation |
---|---|
bin | 101111001000111001001… |
… | …001110001110110000101 |
3 | 102110200100212020210222111 |
4 | 233020321021301312011 |
5 | 411033204214042312 |
6 | 10520050545101021 |
7 | 453015315302665 |
oct | 57107111616605 |
9 | 12420325223874 |
10 | 3239364205957 |
11 | 103989670a4a0 |
12 | 443988627771 |
13 | 1a6617282729 |
14 | b2b00d621a5 |
15 | 593e39618a7 |
hex | 2f239271d85 |
3239364205957 has 12 divisors (see below), whose sum is σ = 3651524359488. Its totient is φ = 2849880523800.
The previous prime is 3239364205949. The next prime is 3239364205969. The reversal of 3239364205957 is 7595024639323.
3239364205957 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3239364205957 - 23 = 3239364205949 is a prime.
It is a super-2 number, since 2×32393642059572 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3239364205937) 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, 153208813 + ... + 153229954.
It is an arithmetic number, because the mean of its divisors is an integer number (304293696624).
Almost surely, 23239364205957 is an apocalyptic number.
It is an amenable number.
3239364205957 is a deficient number, since it is larger than the sum of its proper divisors (412160153531).
3239364205957 is a wasteful number, since it uses less digits than its factorization.
3239364205957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306438840 (or 306438809 counting only the distinct ones).
The product of its (nonzero) digits is 36741600, while the sum is 58.
The spelling of 3239364205957 in words is "three trillion, two hundred thirty-nine billion, three hundred sixty-four million, two hundred five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •