Base | Representation |
---|---|
bin | 1010101001111011110111… |
… | …10101111101010100011000 |
3 | 10001221222211100020112210120 |
4 | 11110331323311331110120 |
5 | 11032343420312421130 |
6 | 121500035424313240 |
7 | 4635562050514002 |
oct | 524757365752430 |
9 | 101858740215716 |
10 | 23431124342040 |
11 | 75140a192aa38 |
12 | 2765138172820 |
13 | 100c71273b5bc |
14 | 5b0102bd9372 |
15 | 2a976d690910 |
hex | 154f7bd7d518 |
23431124342040 has 32 divisors (see below), whose sum is σ = 70293373026480. Its totient is φ = 6248299824512.
The previous prime is 23431124342009. The next prime is 23431124342077. The reversal of 23431124342040 is 4024342113432.
It is a super-2 number, since 2×234311243420402 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23431124341992 and 23431124342010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97629684639 + ... + 97629684878.
Almost surely, 223431124342040 is an apocalyptic number.
23431124342040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23431124342040 is an abundant number, since it is smaller than the sum of its proper divisors (46862248684440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23431124342040 is a wasteful number, since it uses less digits than its factorization.
23431124342040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195259369531 (or 195259369527 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 23431124342040 its reverse (4024342113432), we get a palindrome (27455466455472).
The spelling of 23431124342040 in words is "twenty-three trillion, four hundred thirty-one billion, one hundred twenty-four million, three hundred forty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •