Base | Representation |
---|---|
bin | 1101100000101110000… |
… | …0111000010000111111 |
3 | 211012010221100222220221 |
4 | 3120023200320100333 |
5 | 12300341034334211 |
6 | 254345103122211 |
7 | 22525120236412 |
oct | 3301340702077 |
9 | 735127328827 |
10 | 232121402431 |
11 | 8a495531286 |
12 | 38ba0ba3367 |
13 | 18b73056989 |
14 | b340187b79 |
15 | 6088441c71 |
hex | 360b83843f |
232121402431 has 8 divisors (see below), whose sum is σ = 247049054784. Its totient is φ = 217335244800.
The previous prime is 232121402419. The next prime is 232121402441. The reversal of 232121402431 is 134204121232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 232121402431 - 25 = 232121402399 is a prime.
It is a super-2 number, since 2×2321214024312 (a number of 24 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 = 232121402396 and 232121402405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232121402411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35370295 + ... + 35376856.
It is an arithmetic number, because the mean of its divisors is an integer number (30881131848).
Almost surely, 2232121402431 is an apocalyptic number.
232121402431 is a deficient number, since it is larger than the sum of its proper divisors (14927652353).
232121402431 is a wasteful number, since it uses less digits than its factorization.
232121402431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70747361.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 232121402431 its reverse (134204121232), we get a palindrome (366325523663).
The spelling of 232121402431 in words is "two hundred thirty-two billion, one hundred twenty-one million, four hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •