Base | Representation |
---|---|
bin | 1001010100000111… |
… | …01000000101110010 |
3 | 110220111102211010100 |
4 | 10222003220011302 |
5 | 40220120423020 |
6 | 2144111213230 |
7 | 234630032034 |
oct | 45203500562 |
9 | 13814384110 |
10 | 5000561010 |
11 | 2136760555 |
12 | b76817216 |
13 | 618cc7053 |
14 | 3561a9c54 |
15 | 1e4017a90 |
hex | 12a0e8172 |
5000561010 has 48 divisors (see below), whose sum is σ = 13214611800. Its totient is φ = 1311621120.
The previous prime is 5000560997. The next prime is 5000561017. The reversal of 5000561010 is 101650005.
5000561010 is a `hidden beast` number, since 50 + 0 + 0 + 5 + 610 + 1 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 2284170849 + 2716390161 = 47793^2 + 52119^2 .
It is a super-2 number, since 2×50005610102 = 50011220829464440200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (5000561017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 449935 + ... + 460914.
Almost surely, 25000561010 is an apocalyptic number.
5000561010 is an abundant number, since it is smaller than the sum of its proper divisors (8214050790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5000561010 is a wasteful number, since it uses less digits than its factorization.
5000561010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910923 (or 910920 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 5000561010 is about 70714.6449471395. The cubic root of 5000561010 is about 1710.0398985253.
The spelling of 5000561010 in words is "five billion, five hundred sixty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •