Base | Representation |
---|---|
bin | 110100110011000000110111… |
… | …111110100010010110000111 |
3 | 1010110011111020120012001221011 |
4 | 310303000313332202112013 |
5 | 220413412344031001211 |
6 | 2141505022435303051 |
7 | 66624121564454263 |
oct | 6463006776422607 |
9 | 1113144216161834 |
10 | 232204051031431 |
11 | 67a95204295246 |
12 | 2206284aa4aa87 |
13 | 9c7499562ca7b |
14 | 414aa4397b0a3 |
15 | 1bca260c70921 |
hex | d33037fa2587 |
232204051031431 has 32 divisors (see below), whose sum is σ = 248165242214400. Its totient is φ = 216963107262720.
The previous prime is 232204051031321. The next prime is 232204051031437. The reversal of 232204051031431 is 134130150402232.
It is a cyclic number.
It is not a de Polignac number, because 232204051031431 - 221 = 232204048934279 is a prime.
It is a super-2 number, since 2×2322040510314312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232204051031393 and 232204051031402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232204051031437) 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, 35708190 + ... + 41707108.
It is an arithmetic number, because the mean of its divisors is an integer number (7755163819200).
Almost surely, 2232204051031431 is an apocalyptic number.
232204051031431 is a deficient number, since it is larger than the sum of its proper divisors (15961191182969).
232204051031431 is a wasteful number, since it uses less digits than its factorization.
232204051031431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5999439.
The product of its (nonzero) digits is 17280, while the sum is 31.
The spelling of 232204051031431 in words is "two hundred thirty-two trillion, two hundred four billion, fifty-one million, thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •