Base | Representation |
---|---|
bin | 101111000001001101001… |
… | …010111100001110010101 |
3 | 102102220001121201211010211 |
4 | 233001031022330032111 |
5 | 410414303142322331 |
6 | 10512203531245421 |
7 | 452303630603305 |
oct | 57011512741625 |
9 | 12386047654124 |
10 | 3231110120341 |
11 | 1036340478834 |
12 | 4422642a9871 |
13 | 1a59001c93bc |
14 | b255aa37605 |
15 | 590adec68b1 |
hex | 2f04d2bc395 |
3231110120341 has 2 divisors, whose sum is σ = 3231110120342. Its totient is φ = 3231110120340.
The previous prime is 3231110120323. The next prime is 3231110120347. The reversal of 3231110120341 is 1430210111323.
3231110120341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2809059800625 + 422050319716 = 1676025^2 + 649654^2 .
It is a cyclic number.
It is not a de Polignac number, because 3231110120341 - 25 = 3231110120309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3231110120347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1615555060170 + 1615555060171.
It is an arithmetic number, because the mean of its divisors is an integer number (1615555060171).
Almost surely, 23231110120341 is an apocalyptic number.
It is an amenable number.
3231110120341 is a deficient number, since it is larger than the sum of its proper divisors (1).
3231110120341 is an equidigital number, since it uses as much as digits as its factorization.
3231110120341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 3231110120341 its reverse (1430210111323), we get a palindrome (4661320231664).
The spelling of 3231110120341 in words is "three trillion, two hundred thirty-one billion, one hundred ten million, one hundred twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •