Base | Representation |
---|---|
bin | 101110100101011101100… |
… | …111010011100101001111 |
3 | 102100001011120122220122120 |
4 | 232211131213103211033 |
5 | 404422301213023211 |
6 | 10450355555544023 |
7 | 450200503252515 |
oct | 56453547234517 |
9 | 12301146586576 |
10 | 3201321220431 |
11 | 1024744409394 |
12 | 43852bbbb013 |
13 | 1a2b637a6ac9 |
14 | b0d326604b5 |
15 | 58418b9ad06 |
hex | 2e95d9d394f |
3201321220431 has 16 divisors (see below), whose sum is σ = 4532844215040. Its totient is φ = 2003994276480.
The previous prime is 3201321220421. The next prime is 3201321220453. The reversal of 3201321220431 is 1340221231023.
3201321220431 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3201321220431 - 25 = 3201321220399 is a prime.
It is a super-2 number, since 2×32013212204312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201321220421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 248504755 + ... + 248517636.
It is an arithmetic number, because the mean of its divisors is an integer number (283302763440).
Almost surely, 23201321220431 is an apocalyptic number.
3201321220431 is a deficient number, since it is larger than the sum of its proper divisors (1331522994609).
3201321220431 is a wasteful number, since it uses less digits than its factorization.
3201321220431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497022526.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 3201321220431 its reverse (1340221231023), we get a palindrome (4541542451454).
The spelling of 3201321220431 in words is "three trillion, two hundred one billion, three hundred twenty-one million, two hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •