Base | Representation |
---|---|
bin | 110100110001110101100000… |
… | …111000110010100010010001 |
3 | 1010102212202101020122210011201 |
4 | 310301311200320302202101 |
5 | 220411101134022341423 |
6 | 2141403521205311201 |
7 | 66615225424604440 |
oct | 6461654070624221 |
9 | 1112782336583151 |
10 | 232123133012113 |
11 | 67a63960169712 |
12 | 2204b027705501 |
13 | 9c6a16b262875 |
14 | 4146b68d14d57 |
15 | 1bc80c6db62ad |
hex | d31d60e32891 |
232123133012113 has 32 divisors (see below), whose sum is σ = 281932928494848. Its totient is φ = 186564001228800.
The previous prime is 232123133012087. The next prime is 232123133012131. The reversal of 232123133012113 is 311210331321232.
It is a cyclic number.
It is not a de Polignac number, because 232123133012113 - 229 = 232122596141201 is a prime.
It is a super-2 number, since 2×2321231330121132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (232123133012143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31172598 + ... + 37894288.
It is an arithmetic number, because the mean of its divisors is an integer number (8810404015464).
Almost surely, 2232123133012113 is an apocalyptic number.
It is an amenable number.
232123133012113 is a deficient number, since it is larger than the sum of its proper divisors (49809795482735).
232123133012113 is a wasteful number, since it uses less digits than its factorization.
232123133012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6722793.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 232123133012113 its reverse (311210331321232), we get a palindrome (543333464333345).
The spelling of 232123133012113 in words is "two hundred thirty-two trillion, one hundred twenty-three billion, one hundred thirty-three million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •