Base | Representation |
---|---|
bin | 1101100001100000000… |
… | …1101100110110011111 |
3 | 211012200120101120120001 |
4 | 3120120001230312133 |
5 | 12301303310124043 |
6 | 254422002435131 |
7 | 22533246514066 |
oct | 3303001546637 |
9 | 735616346501 |
10 | 232331333023 |
11 | 8a592a87239 |
12 | 3903b362aa7 |
13 | 18ba76aa06a |
14 | b35ddd31dd |
15 | 609baad74d |
hex | 361806cd9f |
232331333023 has 2 divisors, whose sum is σ = 232331333024. Its totient is φ = 232331333022.
The previous prime is 232331332993. The next prime is 232331333041. The reversal of 232331333023 is 320333133232.
232331333023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 232331333023 - 25 = 232331332991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232331332982 and 232331333000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232331333723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116165666511 + 116165666512.
It is an arithmetic number, because the mean of its divisors is an integer number (116165666512).
Almost surely, 2232331333023 is an apocalyptic number.
232331333023 is a deficient number, since it is larger than the sum of its proper divisors (1).
232331333023 is an equidigital number, since it uses as much as digits as its factorization.
232331333023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 232331333023 its reverse (320333133232), we get a palindrome (552664466255).
The spelling of 232331333023 in words is "two hundred thirty-two billion, three hundred thirty-one million, three hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •