Base | Representation |
---|---|
bin | 111001100011001000000001… |
… | …001101101111010001100000 |
3 | 1020012011100122102212220110110 |
4 | 321203020001031233101200 |
5 | 231133312300420211000 |
6 | 2254145353542131320 |
7 | 104212022326406250 |
oct | 7143100115572140 |
9 | 1205140572786413 |
10 | 253102443132000 |
11 | 73712163865470 |
12 | 24478b48120b40 |
13 | ab2c5c522c407 |
14 | 467031b831960 |
15 | 1e3db96dc3850 |
hex | e6320136f460 |
253102443132000 has 384 divisors, whose sum is σ = 1033762418777088. Its totient is φ = 52592715264000.
The previous prime is 253102443131977. The next prime is 253102443132053. The reversal of 253102443132000 is 231344201352.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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, 136036197 + ... + 137884196.
It is an arithmetic number, because the mean of its divisors is an integer number (2692089632232).
Almost surely, 2253102443132000 is an apocalyptic number.
253102443132000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
253102443132000 is an abundant number, since it is smaller than the sum of its proper divisors (780659975645088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253102443132000 is a wasteful number, since it uses less digits than its factorization.
253102443132000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273920439 (or 273920421 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 253102443132000 its reverse (231344201352), we get a palindrome (253333787333352).
The spelling of 253102443132000 in words is "two hundred fifty-three trillion, one hundred two billion, four hundred forty-three million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •