Base | Representation |
---|---|
bin | 101110100101011101110… |
… | …101101111101001110111 |
3 | 102100001011211210012200202 |
4 | 232211131311233221313 |
5 | 404422303200133211 |
6 | 10450400213031115 |
7 | 450200550365510 |
oct | 56453565575167 |
9 | 12301154705622 |
10 | 3201325005431 |
11 | 1024746564093 |
12 | 43853132549b |
13 | 1a2b64500857 |
14 | b0d32d67a07 |
15 | 5841919753b |
hex | 2e95dd6fa77 |
3201325005431 has 4 divisors (see below), whose sum is σ = 3658657149072. Its totient is φ = 2743992861792.
The previous prime is 3201325005379. The next prime is 3201325005457. The reversal of 3201325005431 is 1345005231023.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3201325005431 - 210 = 3201325004407 is a prime.
It is a super-2 number, since 2×32013250054312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3201325005394 and 3201325005403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201325005481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 228666071810 + ... + 228666071823.
It is an arithmetic number, because the mean of its divisors is an integer number (914664287268).
Almost surely, 23201325005431 is an apocalyptic number.
3201325005431 is a deficient number, since it is larger than the sum of its proper divisors (457332143641).
3201325005431 is an equidigital number, since it uses as much as digits as its factorization.
3201325005431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 457332143640.
The product of its (nonzero) digits is 10800, while the sum is 29.
The spelling of 3201325005431 in words is "three trillion, two hundred one billion, three hundred twenty-five million, five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •