Base | Representation |
---|---|
bin | 110100100111110001000001… |
… | …010010010111001001101000 |
3 | 1010100102121011012010100221020 |
4 | 310213301001102113021220 |
5 | 220313231404424010440 |
6 | 2140113552521212440 |
7 | 66514226504520660 |
oct | 6447610122271150 |
9 | 1110377135110836 |
10 | 231431113110120 |
11 | 67817424a54840 |
12 | 21b58a97631120 |
13 | 9c19b2518b111 |
14 | 412147b7b71a0 |
15 | 1bb50c36c73d0 |
hex | d27c41497268 |
231431113110120 has 256 divisors, whose sum is σ = 873702314956800. Its totient is φ = 47640146396160.
The previous prime is 231431113110079. The next prime is 231431113110133. The reversal of 231431113110120 is 21011311134132.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 116051775 + ... + 118029134.
It is an arithmetic number, because the mean of its divisors is an integer number (3412899667800).
Almost surely, 2231431113110120 is an apocalyptic number.
231431113110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
231431113110120 is an abundant number, since it is smaller than the sum of its proper divisors (642271201846680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231431113110120 is a wasteful number, since it uses less digits than its factorization.
231431113110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234081048 (or 234081044 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 231431113110120 its reverse (21011311134132), we get a palindrome (252442424244252).
The spelling of 231431113110120 in words is "two hundred thirty-one trillion, four hundred thirty-one billion, one hundred thirteen million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •