Base | Representation |
---|---|
bin | 110000100000001000… |
… | …0011011000111011100 |
3 | 100221211220021011000111 |
4 | 1201000100123013130 |
5 | 3201303224343200 |
6 | 115503231335404 |
7 | 10345054056520 |
oct | 1410020330734 |
9 | 327756234014 |
10 | 104157262300 |
11 | 4019a071873 |
12 | 1822a081564 |
13 | 9a8bba3770 |
14 | 508122dd80 |
15 | 2a991c60ba |
hex | 184041b1dc |
104157262300 has 144 divisors (see below), whose sum is σ = 279792217152. Its totient is φ = 32773017600.
The previous prime is 104157262289. The next prime is 104157262301. The reversal of 104157262300 is 3262751401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104157262301) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1541220 + ... + 1607380.
It is an arithmetic number, because the mean of its divisors is an integer number (1943001508).
Almost surely, 2104157262300 is an apocalyptic number.
104157262300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104157262300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139896108576).
104157262300 is an abundant number, since it is smaller than the sum of its proper divisors (175634954852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104157262300 is a wasteful number, since it uses less digits than its factorization.
104157262300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66368 (or 66361 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
The spelling of 104157262300 in words is "one hundred four billion, one hundred fifty-seven million, two hundred sixty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •