Base | Representation |
---|---|
bin | 10111010010010011101010… |
… | …111001101101010111100000 |
3 | 111102121121012220012222222121 |
4 | 113102103222321231113200 |
5 | 101410414103121434100 |
6 | 1001451540401314024 |
7 | 30400051053004630 |
oct | 2722235271552740 |
9 | 442547186188877 |
10 | 102413141202400 |
11 | 2a6a5195338206 |
12 | b5a0429935914 |
13 | 451b696728a52 |
14 | 1b40b72c686c0 |
15 | bc9002bda51a |
hex | 5d24eae6d5e0 |
102413141202400 has 144 divisors (see below), whose sum is σ = 293455168979616. Its totient is φ = 34164074833920.
The previous prime is 102413141202377. The next prime is 102413141202419. The reversal of 102413141202400 is 4202141314201.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 246928759 + ... + 247343158.
It is an arithmetic number, because the mean of its divisors is an integer number (2037883117914).
Almost surely, 2102413141202400 is an apocalyptic number.
102413141202400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102413141202400 is an abundant number, since it is smaller than the sum of its proper divisors (191042027777216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102413141202400 is a wasteful number, since it uses less digits than its factorization.
102413141202400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494271981 (or 494271968 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 102413141202400 its reverse (4202141314201), we get a palindrome (106615282516601).
The spelling of 102413141202400 in words is "one hundred two trillion, four hundred thirteen billion, one hundred forty-one million, two hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •