Base | Representation |
---|---|
bin | 110100110001110101100000… |
… | …110001111000100111100111 |
3 | 1010102212202101010020211012100 |
4 | 310301311200301320213213 |
5 | 220411101133041431043 |
6 | 2141403521102423143 |
7 | 66615225403325265 |
oct | 6461654061704747 |
9 | 1112782333224170 |
10 | 232123131202023 |
11 | 67a6395a142776 |
12 | 2204b026b91ab3 |
13 | 9c6a16aa7a9c9 |
14 | 4146b689a3435 |
15 | 1bc80c6b59cd3 |
hex | d31d60c789e7 |
232123131202023 has 12 divisors (see below), whose sum is σ = 335289103465888. Its totient is φ = 154748691285120.
The previous prime is 232123131202019. The next prime is 232123131202057. The reversal of 232123131202023 is 320202131321232.
232123131202023 is a `hidden beast` number, since 2 + 3 + 21 + 2 + 313 + 120 + 202 + 3 = 666.
It is not a de Polignac number, because 232123131202023 - 22 = 232123131202019 is a prime.
It is a super-2 number, since 2×2321231312020232 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232123131206023) 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, 32354103 + ... + 38872023.
Almost surely, 2232123131202023 is an apocalyptic number.
232123131202023 is a deficient number, since it is larger than the sum of its proper divisors (103165972263865).
232123131202023 is a wasteful number, since it uses less digits than its factorization.
232123131202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10474934 (or 10474931 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 232123131202023 its reverse (320202131321232), we get a palindrome (552325262523255).
The spelling of 232123131202023 in words is "two hundred thirty-two trillion, one hundred twenty-three billion, one hundred thirty-one million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •