Base | Representation |
---|---|
bin | 10000001100110110100… |
… | …00010001010110101010 |
3 | 1222012211021120002010210 |
4 | 20012123100101112222 |
5 | 33110012302440200 |
6 | 1103420215321550 |
7 | 55134304544145 |
oct | 10063320212652 |
9 | 1865737502123 |
10 | 556655515050 |
11 | 1a5092587508 |
12 | 8ba729802b6 |
13 | 40652a1b88b |
14 | 1cd2983b05c |
15 | e72e947650 |
hex | 819b4115aa |
556655515050 has 96 divisors (see below), whose sum is σ = 1432434693312. Its totient is φ = 142940436480.
The previous prime is 556655515001. The next prime is 556655515051. The reversal of 556655515050 is 50515556655.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (556655515051) 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, 21349 + ... + 1055351.
It is an arithmetic number, because the mean of its divisors is an integer number (14921194722).
Almost surely, 2556655515050 is an apocalyptic number.
556655515050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 556655515050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (716217346656).
556655515050 is an abundant number, since it is smaller than the sum of its proper divisors (875779178262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556655515050 is a wasteful number, since it uses less digits than its factorization.
556655515050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1034152 (or 1034147 counting only the distinct ones).
The product of its (nonzero) digits is 2812500, while the sum is 48.
The spelling of 556655515050 in words is "five hundred fifty-six billion, six hundred fifty-five million, five hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •