Base | Representation |
---|---|
bin | 1101100001100000100… |
… | …0001011111001001001 |
3 | 211012200200120221112101 |
4 | 3120120020023321021 |
5 | 12301304224024113 |
6 | 254422103113401 |
7 | 22533300124303 |
oct | 3303010137111 |
9 | 735620527471 |
10 | 232333033033 |
11 | 8a593a38502 |
12 | 3903ba42861 |
13 | 18ba7b53a9a |
14 | b360316973 |
15 | 609bce72dd |
hex | 361820be49 |
232333033033 has 2 divisors, whose sum is σ = 232333033034. Its totient is φ = 232333033032.
The previous prime is 232333033019. The next prime is 232333033061. The reversal of 232333033033 is 330330333232.
It is an a-pointer prime, because the next prime (232333033061) can be obtained adding 232333033033 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 158266321929 + 74066711104 = 397827^2 + 272152^2 .
It is a cyclic number.
It is not a de Polignac number, because 232333033033 - 25 = 232333033001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232333032992 and 232333033010.
It is not a weakly prime, because it can be changed into another prime (232333033333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116166516516 + 116166516517.
It is an arithmetic number, because the mean of its divisors is an integer number (116166516517).
Almost surely, 2232333033033 is an apocalyptic number.
It is an amenable number.
232333033033 is a deficient number, since it is larger than the sum of its proper divisors (1).
232333033033 is an equidigital number, since it uses as much as digits as its factorization.
232333033033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26244, while the sum is 28.
Adding to 232333033033 its reverse (330330333232), we get a palindrome (562663366265).
The spelling of 232333033033 in words is "two hundred thirty-two billion, three hundred thirty-three million, thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •