Base | Representation |
---|---|
bin | 101111000001001101010… |
… | …010101001111001000001 |
3 | 102102220001202112112212221 |
4 | 233001031102221321001 |
5 | 410414304202024101 |
6 | 10512204042451041 |
7 | 452303654024443 |
oct | 57011522517101 |
9 | 12386052475787 |
10 | 3231112142401 |
11 | 1036341629a60 |
12 | 442264b03a81 |
13 | 1a59007568a0 |
14 | b255b002493 |
15 | 590ae275aa1 |
hex | 2f04d4a9e41 |
3231112142401 has 16 divisors (see below), whose sum is σ = 3801213456768. Its totient is φ = 2707693084800.
The previous prime is 3231112142359. The next prime is 3231112142443. The reversal of 3231112142401 is 1042412111323.
It is an interprime number because it is at equal distance from previous prime (3231112142359) and next prime (3231112142443).
It is not a de Polignac number, because 3231112142401 - 217 = 3231112011329 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3231112142701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15436060 + ... + 15643981.
It is an arithmetic number, because the mean of its divisors is an integer number (237575841048).
Almost surely, 23231112142401 is an apocalyptic number.
It is an amenable number.
3231112142401 is a deficient number, since it is larger than the sum of its proper divisors (570101314367).
3231112142401 is a wasteful number, since it uses less digits than its factorization.
3231112142401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31080792.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 3231112142401 its reverse (1042412111323), we get a palindrome (4273524253724).
The spelling of 3231112142401 in words is "three trillion, two hundred thirty-one billion, one hundred twelve million, one hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •