Base | Representation |
---|---|
bin | 10111101110001101111101… |
… | …111000010101000101001110 |
3 | 111200101221222002200120011012 |
4 | 113232031331320111011032 |
5 | 102133330210100134200 |
6 | 1005521024022325222 |
7 | 30655451316043631 |
oct | 2756157570250516 |
9 | 450357862616135 |
10 | 104331162505550 |
11 | 30274663365762 |
12 | b8500b3289812 |
13 | 462a503c2c576 |
14 | 1ba9925c6bc18 |
15 | c0dd5db43a35 |
hex | 5ee37de1514e |
104331162505550 has 12 divisors (see below), whose sum is σ = 194055962260416. Its totient is φ = 41732465002200.
The previous prime is 104331162505529. The next prime is 104331162505579. The reversal of 104331162505550 is 55505261133401.
104331162505550 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 104331162505498 and 104331162505507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1043311625006 + ... + 1043311625105.
It is an arithmetic number, because the mean of its divisors is an integer number (16171330188368).
Almost surely, 2104331162505550 is an apocalyptic number.
104331162505550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104331162505550 is a deficient number, since it is larger than the sum of its proper divisors (89724799754866).
104331162505550 is a wasteful number, since it uses less digits than its factorization.
104331162505550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2086623250123 (or 2086623250118 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 104331162505550 in words is "one hundred four trillion, three hundred thirty-one billion, one hundred sixty-two million, five hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •