Base | Representation |
---|---|
bin | 100100101111110011010… |
… | …0100111000001111010101 |
3 | 122212211002220002200201200 |
4 | 1021133212210320033111 |
5 | 1130221312440000041 |
6 | 14424051430143113 |
7 | 1030611661120434 |
oct | 111374644701725 |
9 | 18784086080650 |
10 | 5050455000021 |
11 | 1677982200892 |
12 | 69698b1b1a99 |
13 | 2a8343191772 |
14 | 13662c6b711b |
15 | 8b591ee11b6 |
hex | 497e69383d5 |
5050455000021 has 12 divisors (see below), whose sum is σ = 7295122280160. Its totient is φ = 3366960486120.
The previous prime is 5050455000013. The next prime is 5050455000049. The reversal of 5050455000021 is 1200005540505.
5050455000021 is a `hidden beast` number, since 50 + 50 + 45 + 500 + 0 + 0 + 21 = 666.
It is not a de Polignac number, because 5050455000021 - 23 = 5050455000013 is a prime.
It is a super-2 number, since 2×50504550000212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5050450000021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4272490 + ... + 5324948.
It is an arithmetic number, because the mean of its divisors is an integer number (607926856680).
Almost surely, 25050455000021 is an apocalyptic number.
It is an amenable number.
5050455000021 is a deficient number, since it is larger than the sum of its proper divisors (2244667280139).
5050455000021 is a wasteful number, since it uses less digits than its factorization.
5050455000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1585656 (or 1585653 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The spelling of 5050455000021 in words is "five trillion, fifty billion, four hundred fifty-five million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •