Base | Representation |
---|---|
bin | 10000010101001000111… |
… | …01101111111101000100 |
3 | 1222122022101001212102120 |
4 | 20022210131233331010 |
5 | 33143120340314000 |
6 | 1105433523405540 |
7 | 55352463616116 |
oct | 10124435577504 |
9 | 1878271055376 |
10 | 561105010500 |
11 | 1a6a66172281 |
12 | 908b4b238b0 |
13 | 40bb17c1418 |
14 | 1d22c75b3b6 |
15 | e8e03ab6a0 |
hex | 82a476ff44 |
561105010500 has 48 divisors (see below), whose sum is σ = 1633937794944. Its totient is φ = 149628002400.
The previous prime is 561105010481. The next prime is 561105010517. The reversal of 561105010500 is 5010501165.
561105010500 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×5611050105002 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 187033504 + ... + 187036503.
It is an arithmetic number, because the mean of its divisors is an integer number (34040370728).
Almost surely, 2561105010500 is an apocalyptic number.
561105010500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
561105010500 is an abundant number, since it is smaller than the sum of its proper divisors (1072832784444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561105010500 is a wasteful number, since it uses less digits than its factorization.
561105010500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374070029 (or 374070017 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 561105010500 its reverse (5010501165), we get a palindrome (566115511665).
The spelling of 561105010500 in words is "five hundred sixty-one billion, one hundred five million, ten thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •