Base | Representation |
---|---|
bin | 110100110100101111110010… |
… | …011011110111110100111001 |
3 | 1010110120212122022111021012212 |
4 | 310310233302123313310321 |
5 | 220422340244202311021 |
6 | 2142035440110144505 |
7 | 66635536033060160 |
oct | 6464576233676471 |
9 | 1113525568437185 |
10 | 232323143400761 |
11 | 68030767885a76 |
12 | 220819467b2135 |
13 | 9c82c9477b46a |
14 | 415270053c3d7 |
15 | 1bcd3d11dd85b |
hex | d34bf26f7d39 |
232323143400761 has 16 divisors (see below), whose sum is σ = 267216903773568. Its totient is φ = 197857033411200.
The previous prime is 232323143400727. The next prime is 232323143400769. The reversal of 232323143400761 is 167004341323232.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232323143400761 is a prime.
It is a super-2 number, since 2×2323231434007612 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (232323143400769) 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, 59155460 + ... + 62960421.
It is an arithmetic number, because the mean of its divisors is an integer number (16701056485848).
Almost surely, 2232323143400761 is an apocalyptic number.
It is an amenable number.
232323143400761 is a deficient number, since it is larger than the sum of its proper divisors (34893760372807).
232323143400761 is a wasteful number, since it uses less digits than its factorization.
232323143400761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122117632.
The product of its (nonzero) digits is 435456, while the sum is 41.
Adding to 232323143400761 its reverse (167004341323232), we get a palindrome (399327484723993).
The spelling of 232323143400761 in words is "two hundred thirty-two trillion, three hundred twenty-three billion, one hundred forty-three million, four hundred thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.707 sec. • engine limits •