Base | Representation |
---|---|
bin | 101111000001001101010… |
… | …110000000111010010001 |
3 | 102102220001211012022000012 |
4 | 233001031112000322101 |
5 | 410414304413214441 |
6 | 10512204113404305 |
7 | 452303664353234 |
oct | 57011526007221 |
9 | 12386054168005 |
10 | 3231113023121 |
11 | 1036342080725 |
12 | 442265269695 |
13 | 1a59009a4719 |
14 | b255b19141b |
15 | 590ae39b9eb |
hex | 2f04d580e91 |
3231113023121 has 4 divisors (see below), whose sum is σ = 3231501526452. Its totient is φ = 3230724519792.
The previous prime is 3231113023051. The next prime is 3231113023163. The reversal of 3231113023121 is 1213203111323.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2966851227025 + 264261796096 = 1722455^2 + 514064^2 .
It is a cyclic number.
It is not a de Polignac number, because 3231113023121 - 230 = 3230039281297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3231113023181) 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, 194239190 + ... + 194255823.
It is an arithmetic number, because the mean of its divisors is an integer number (807875381613).
Almost surely, 23231113023121 is an apocalyptic number.
It is an amenable number.
3231113023121 is a deficient number, since it is larger than the sum of its proper divisors (388503331).
3231113023121 is an equidigital number, since it uses as much as digits as its factorization.
3231113023121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388503330.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3231113023121 its reverse (1213203111323), we get a palindrome (4444316134444).
The spelling of 3231113023121 in words is "three trillion, two hundred thirty-one billion, one hundred thirteen million, twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •