Base | Representation |
---|---|
bin | 1101100000110000001… |
… | …0011100111011000011 |
3 | 211012011112221010111012 |
4 | 3120030002130323003 |
5 | 12300400313001311 |
6 | 254350015511135 |
7 | 22525255113125 |
oct | 3301402347303 |
9 | 735145833435 |
10 | 232130203331 |
11 | 8a49a4a2554 |
12 | 38ba3b284ab |
13 | 18b74b18800 |
14 | b3413d9215 |
15 | 60890ce78b |
hex | 360c09cec3 |
232130203331 has 24 divisors (see below), whose sum is σ = 268501450320. Its totient is φ = 199884711936.
The previous prime is 232130203313. The next prime is 232130203343. The reversal of 232130203331 is 133302031232.
It is not a de Polignac number, because 232130203331 - 26 = 232130203267 is a prime.
It is a super-2 number, since 2×2321302033312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 232130203297 and 232130203306.
It is not an unprimeable number, because it can be changed into a prime (232130203381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32861 + ... + 682158.
It is an arithmetic number, because the mean of its divisors is an integer number (11187560430).
Almost surely, 2232130203331 is an apocalyptic number.
232130203331 is a deficient number, since it is larger than the sum of its proper divisors (36371246989).
232130203331 is a wasteful number, since it uses less digits than its factorization.
232130203331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715175 (or 715162 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 232130203331 its reverse (133302031232), we get a palindrome (365432234563).
The spelling of 232130203331 in words is "two hundred thirty-two billion, one hundred thirty million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •