Base | Representation |
---|---|
bin | 100011011000001010001… |
… | …111110010011011010000 |
3 | 22121102011011120202222020 |
4 | 203120022033302123100 |
5 | 304312420042303100 |
6 | 5100502003411440 |
7 | 340433334641532 |
oct | 43301217623320 |
9 | 8542134522866 |
10 | 2431123400400 |
11 | 8580408645a2 |
12 | 333202383b80 |
13 | 14833bc1c566 |
14 | 8594a36b852 |
15 | 4338be595a0 |
hex | 2360a3f26d0 |
2431123400400 has 60 divisors (see below), whose sum is σ = 7787698629792. Its totient is φ = 648299573120.
The previous prime is 2431123400369. The next prime is 2431123400483. The reversal of 2431123400400 is 40043211342.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1012966884 + ... + 1012969283.
Almost surely, 22431123400400 is an apocalyptic number.
2431123400400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2431123400400 is an abundant number, since it is smaller than the sum of its proper divisors (5356575229392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2431123400400 is a wasteful number, since it uses less digits than its factorization.
2431123400400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2025936188 (or 2025936177 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 2431123400400 its reverse (40043211342), we get a palindrome (2471166611742).
The spelling of 2431123400400 in words is "two trillion, four hundred thirty-one billion, one hundred twenty-three million, four hundred thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •