Base | Representation |
---|---|
bin | 1101100001001000101… |
… | …1010111000101010001 |
3 | 211012102201202000002202 |
4 | 3120102023113011101 |
5 | 12301103144431001 |
6 | 254404135252545 |
7 | 22530645434603 |
oct | 3302213270521 |
9 | 735381660082 |
10 | 232233202001 |
11 | 8a542651a19 |
12 | 3901251a155 |
13 | 18b9026c178 |
14 | b350d6b173 |
15 | 609317796b |
hex | 36122d7151 |
232233202001 has 8 divisors (see below), whose sum is σ = 232516804608. Its totient is φ = 231949768000.
The previous prime is 232233201971. The next prime is 232233202007. The reversal of 232233202001 is 100202332232.
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 232233202001 - 234 = 215053332817 is a prime.
It is a super-2 number, since 2×2322332020012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (232233202007) 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 7 ways as a sum of consecutive naturals, for example, 2832656 + ... + 2913486.
It is an arithmetic number, because the mean of its divisors is an integer number (29064600576).
Almost surely, 2232233202001 is an apocalyptic number.
It is an amenable number.
232233202001 is a deficient number, since it is larger than the sum of its proper divisors (283602607).
232233202001 is a wasteful number, since it uses less digits than its factorization.
232233202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84303.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 232233202001 its reverse (100202332232), we get a palindrome (332435534233).
The spelling of 232233202001 in words is "two hundred thirty-two billion, two hundred thirty-three million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •