Base | Representation |
---|---|
bin | 10111101100111001010001… |
… | …010011011000110111011000 |
3 | 111200002021020011220102002102 |
4 | 113230321101103120313120 |
5 | 102130332432344423000 |
6 | 1005411143543422532 |
7 | 30646051556123324 |
oct | 2754712123306730 |
9 | 450067204812072 |
10 | 104240220311000 |
11 | 3023a035912994 |
12 | b836552a54a48 |
13 | 4621a6cb5c227 |
14 | 1ba5379b8c984 |
15 | c0b7d9c033d5 |
hex | 5ece514d8dd8 |
104240220311000 has 64 divisors (see below), whose sum is σ = 244477747800000. Its totient is φ = 41601108249600.
The previous prime is 104240220310999. The next prime is 104240220311057. The reversal of 104240220311000 is 113022042401.
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 polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118285625 + ... + 119163624.
It is an arithmetic number, because the mean of its divisors is an integer number (3819964809375).
Almost surely, 2104240220311000 is an apocalyptic number.
104240220311000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104240220311000 is an abundant number, since it is smaller than the sum of its proper divisors (140237527489000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104240220311000 is a wasteful number, since it uses less digits than its factorization.
104240220311000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237449709 (or 237449695 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 104240220311000 its reverse (113022042401), we get a palindrome (104353242353401).
The spelling of 104240220311000 in words is "one hundred four trillion, two hundred forty billion, two hundred twenty million, three hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •