Base | Representation |
---|---|
bin | 110100110000000110000000… |
… | …110110010010011100101111 |
3 | 1010102110022100112221212211001 |
4 | 310300012000312102130233 |
5 | 220402120440444034043 |
6 | 2141232521212541131 |
7 | 66603456532163041 |
oct | 6460060066223457 |
9 | 1112408315855731 |
10 | 232003410143023 |
11 | 67a18103789102 |
12 | 2202b9947817a7 |
13 | 9c5ba9b5c9cac |
14 | 414104c70ba91 |
15 | 1bc4e1b40374d |
hex | d30180d9272f |
232003410143023 has 16 divisors (see below), whose sum is σ = 237495699302400. Its totient is φ = 226515537220896.
The previous prime is 232003410142991. The next prime is 232003410143059. The reversal of 232003410143023 is 320341014300232.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 232003410143023 - 25 = 232003410142991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232003410142982 and 232003410143000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232003410140023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1595560078 + ... + 1595705476.
It is an arithmetic number, because the mean of its divisors is an integer number (14843481206400).
Almost surely, 2232003410143023 is an apocalyptic number.
232003410143023 is a deficient number, since it is larger than the sum of its proper divisors (5492289159377).
232003410143023 is a wasteful number, since it uses less digits than its factorization.
232003410143023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160326.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 232003410143023 its reverse (320341014300232), we get a palindrome (552344424443255).
The spelling of 232003410143023 in words is "two hundred thirty-two trillion, three billion, four hundred ten million, one hundred forty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •