Base | Representation |
---|---|
bin | 100010111111001100101… |
… | …001000001000111011000 |
3 | 22111211222012022010102202 |
4 | 202333030221001013120 |
5 | 303343021411214000 |
6 | 5040310202145332 |
7 | 335464201665230 |
oct | 42771451010730 |
9 | 8454865263382 |
10 | 2404320023000 |
11 | 847736a77425 |
12 | 329b81ab2248 |
13 | 145959bb292c |
14 | 845266accc0 |
15 | 4281dcb2dd5 |
hex | 22fcca411d8 |
2404320023000 has 128 divisors (see below), whose sum is σ = 6651557827200. Its totient is φ = 795912768000.
The previous prime is 2404320022999. The next prime is 2404320023011. The reversal of 2404320023000 is 3200234042.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 31 ways as a sum of consecutive naturals, for example, 5718971 + ... + 6124970.
It is an arithmetic number, because the mean of its divisors is an integer number (51965295525).
Almost surely, 22404320023000 is an apocalyptic number.
2404320023000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2404320023000 is an abundant number, since it is smaller than the sum of its proper divisors (4247237804200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2404320023000 is a wasteful number, since it uses less digits than its factorization.
2404320023000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11843998 (or 11843984 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 20.
Adding to 2404320023000 its reverse (3200234042), we get a palindrome (2407520257042).
The spelling of 2404320023000 in words is "two trillion, four hundred four billion, three hundred twenty million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •