Base | Representation |
---|---|
bin | 101110001010100010100… |
… | …001010000101011001010 |
3 | 102020021112212210101010010 |
4 | 232022202201100223022 |
5 | 403434100044224430 |
6 | 10425215225332350 |
7 | 445125224156043 |
oct | 56124241205312 |
9 | 12207485711103 |
10 | 3172412492490 |
11 | 101345a16919a |
12 | 432a026370b6 |
13 | 1a0207527b27 |
14 | ad78d1218ca |
15 | 577c5c81cb0 |
hex | 2e2a2850aca |
3172412492490 has 32 divisors (see below), whose sum is σ = 7664889254400. Its totient is φ = 840298967744.
The previous prime is 3172412492489. The next prime is 3172412492527. The reversal of 3172412492490 is 942942142713.
It is a super-2 number, since 2×31724124924902 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 354851514 + ... + 354860453.
It is an arithmetic number, because the mean of its divisors is an integer number (239527789200).
Almost surely, 23172412492490 is an apocalyptic number.
3172412492490 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3172412492490 is an abundant number, since it is smaller than the sum of its proper divisors (4492476761910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3172412492490 is a wasteful number, since it uses less digits than its factorization.
3172412492490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709712126.
The product of its (nonzero) digits is 870912, while the sum is 48.
The spelling of 3172412492490 in words is "three trillion, one hundred seventy-two billion, four hundred twelve million, four hundred ninety-two thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •