Base | Representation |
---|---|
bin | 10111101011101100011001… |
… | …000001001000101001010010 |
3 | 111122210101011012222120202212 |
4 | 113223230121001020221102 |
5 | 102123004402413421000 |
6 | 1005305212422512122 |
7 | 30640100125632230 |
oct | 2753543101105122 |
9 | 448711135876685 |
10 | 104157671623250 |
11 | 30208025278aa3 |
12 | b822555595642 |
13 | 46170459abc6b |
14 | 1ba138872b950 |
15 | c095a7adcc35 |
hex | 5ebb19048a52 |
104157671623250 has 64 divisors (see below), whose sum is σ = 222845653046016. Its totient is φ = 35709959001600.
The previous prime is 104157671623217. The next prime is 104157671623253. The reversal of 104157671623250 is 52326176751401.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104157671623253) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49986242 + ... + 52028258.
It is an arithmetic number, because the mean of its divisors is an integer number (3481963328844).
Almost surely, 2104157671623250 is an apocalyptic number.
104157671623250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104157671623250 is an abundant number, since it is smaller than the sum of its proper divisors (118687981422766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104157671623250 is a wasteful number, since it uses less digits than its factorization.
104157671623250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2071188 (or 2071178 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 50.
The spelling of 104157671623250 in words is "one hundred four trillion, one hundred fifty-seven billion, six hundred seventy-one million, six hundred twenty-three thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •