Base | Representation |
---|---|
bin | 1101100001000001000… |
… | …1000011111100010001 |
3 | 211012100111102012002112 |
4 | 3120100101003330101 |
5 | 12301021443021113 |
6 | 254401032155105 |
7 | 22530106066400 |
oct | 3302021037421 |
9 | 735314365075 |
10 | 232201142033 |
11 | 8a526544883 |
12 | 39003838a95 |
13 | 18b86725683 |
14 | b34a9c3637 |
15 | 60904435a8 |
hex | 3610443f11 |
232201142033 has 12 divisors (see below), whose sum is σ = 270204552180. Its totient is φ = 198961009632.
The previous prime is 232201141993. The next prime is 232201142083. The reversal of 232201142033 is 330241102232.
It can be written as a sum of positive squares in 2 ways, for example, as 73914928129 + 158286213904 = 271873^2 + 397852^2 .
It is not a de Polignac number, because 232201142033 - 224 = 232184364817 is a prime.
It is a super-2 number, since 2×2322011420332 (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 (232201142083) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 671966 + ... + 957047.
It is an arithmetic number, because the mean of its divisors is an integer number (22517046015).
Almost surely, 2232201142033 is an apocalyptic number.
It is an amenable number.
232201142033 is a deficient number, since it is larger than the sum of its proper divisors (38003410147).
232201142033 is a wasteful number, since it uses less digits than its factorization.
232201142033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631936 (or 1631929 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 232201142033 its reverse (330241102232), we get a palindrome (562442244265).
The spelling of 232201142033 in words is "two hundred thirty-two billion, two hundred one million, one hundred forty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •