Base | Representation |
---|---|
bin | 10111110010010001101111… |
… | …110110101001000010001000 |
3 | 111201101121221201220022010122 |
4 | 113302101233312221002020 |
5 | 102202412441103244300 |
6 | 1010253114434202412 |
7 | 31014554541103364 |
oct | 2762215766510210 |
9 | 451347851808118 |
10 | 104610100056200 |
11 | 30371992336022 |
12 | b89617aa23408 |
13 | 464a8c821c59b |
14 | 1bb92279622a4 |
15 | c1623716bc85 |
hex | 5f246fda9088 |
104610100056200 has 48 divisors (see below), whose sum is σ = 256019455410000. Its totient is φ = 39641722125120.
The previous prime is 104610100056197. The next prime is 104610100056239. The reversal of 104610100056200 is 2650001016401.
It is a self number, because there is not a number n which added to its sum of digits gives 104610100056200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13764483050 + ... + 13764490649.
It is an arithmetic number, because the mean of its divisors is an integer number (5333738654375).
Almost surely, 2104610100056200 is an apocalyptic number.
104610100056200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104610100056200 is an abundant number, since it is smaller than the sum of its proper divisors (151409355353800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104610100056200 is a wasteful number, since it uses less digits than its factorization.
104610100056200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27528973734 (or 27528973725 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
The spelling of 104610100056200 in words is "one hundred four trillion, six hundred ten billion, one hundred million, fifty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •