Base | Representation |
---|---|
bin | 110001010110001101111… |
… | …101100011100111011110 |
3 | 110000012001100110121222120 |
4 | 301112031331203213132 |
5 | 421024443343430140 |
6 | 11113504351523410 |
7 | 466666614141654 |
oct | 61261575434736 |
9 | 13005040417876 |
10 | 3391110920670 |
11 | 1098186788220 |
12 | 469278229566 |
13 | 1b7a1b686395 |
14 | ba1b86b8dd4 |
15 | 5d325a711d0 |
hex | 3158df639de |
3391110920670 has 64 divisors (see below), whose sum is σ = 8900909392896. Its totient is φ = 820016714880.
The previous prime is 3391110920647. The next prime is 3391110920671. The reversal of 3391110920670 is 760290111933.
It is a super-2 number, since 2×33911109206702 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3391110920671) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12811174 + ... + 13073193.
It is an arithmetic number, because the mean of its divisors is an integer number (139076709264).
Almost surely, 23391110920670 is an apocalyptic number.
3391110920670 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3391110920670 is an abundant number, since it is smaller than the sum of its proper divisors (5509798472226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3391110920670 is a wasteful number, since it uses less digits than its factorization.
3391110920670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25884785.
The product of its (nonzero) digits is 61236, while the sum is 42.
The spelling of 3391110920670 in words is "three trillion, three hundred ninety-one billion, one hundred ten million, nine hundred twenty thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •