Base | Representation |
---|---|
bin | 10111011010110111000001… |
… | …001111110101001010110000 |
3 | 111111200210012112102111101220 |
4 | 113122313001033311022300 |
5 | 102000031221314044000 |
6 | 1003021534422225040 |
7 | 30460365103555200 |
oct | 2732670117651260 |
9 | 444623175374356 |
10 | 103000852878000 |
11 | 2a90146424a800 |
12 | b676309285180 |
13 | 4561c2858108c |
14 | 1b613a70ba400 |
15 | bd944dd331a0 |
hex | 5dadc13f52b0 |
103000852878000 has 1440 divisors, whose sum is σ = 425357441256384. Its totient is φ = 21364654080000.
The previous prime is 103000852877977. The next prime is 103000852878013. The reversal of 103000852878000 is 878258000301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 22802931742 + ... + 22802936258.
Almost surely, 2103000852878000 is an apocalyptic number.
103000852878000 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 103000852878000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212678720628192).
103000852878000 is an abundant number, since it is smaller than the sum of its proper divisors (322356588378384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103000852878000 is a wasteful number, since it uses less digits than its factorization.
103000852878000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5220 (or 5186 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 42.
The spelling of 103000852878000 in words is "one hundred three trillion, eight hundred fifty-two million, eight hundred seventy-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •