Base | Representation |
---|---|
bin | 10000010100111101101… |
… | …01100110110001011010 |
3 | 1222122001210102101000021 |
4 | 20022132311212301122 |
5 | 33142422203213200 |
6 | 1105420312101054 |
7 | 55350236266654 |
oct | 10123665466132 |
9 | 1878053371007 |
10 | 561010601050 |
11 | 1a6a1794a039 |
12 | 9088939478a |
13 | 40b98087443 |
14 | 1d21ddc36d4 |
15 | e8d6e5d41a |
hex | 829ed66c5a |
561010601050 has 24 divisors (see below), whose sum is σ = 1043508390876. Its totient is φ = 224398074240.
The previous prime is 561010601017. The next prime is 561010601083. The reversal of 561010601050 is 50106010165.
561010601050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (561010601017) and next prime (561010601083).
It can be written as a sum of positive squares in 6 ways, for example, as 163469001969 + 397541599081 = 404313^2 + 630509^2 .
It is a super-2 number, since 2×5610106010502 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1974774 + ... + 2240926.
Almost surely, 2561010601050 is an apocalyptic number.
561010601050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
561010601050 is a deficient number, since it is larger than the sum of its proper divisors (482497789826).
561010601050 is a wasteful number, since it uses less digits than its factorization.
561010601050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308322 (or 308317 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 561010601050 in words is "five hundred sixty-one billion, ten million, six hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •