Base | Representation |
---|---|
bin | 1001010100101001… |
… | …10000010010101010 |
3 | 110220210212221022010 |
4 | 10222110300102222 |
5 | 40222243113200 |
6 | 2144351340350 |
7 | 235013142366 |
oct | 45224602252 |
9 | 13823787263 |
10 | 5005051050 |
11 | 2139247a2a |
12 | b782216b6 |
13 | 619c0998c |
14 | 356a182a6 |
15 | 1e4603150 |
hex | 12a5304aa |
5005051050 has 48 divisors (see below), whose sum is σ = 12748014432. Its totient is φ = 1298606400.
The previous prime is 5005051049. The next prime is 5005051057. The reversal of 5005051050 is 501505005.
It is a super-2 number, since 2×50050510502 = 50101072026212205000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5005051057) 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, 445356 + ... + 456455.
It is an arithmetic number, because the mean of its divisors is an integer number (265583634).
Almost surely, 25005051050 is an apocalyptic number.
5005051050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5005051050 is an abundant number, since it is smaller than the sum of its proper divisors (7742963382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005051050 is a wasteful number, since it uses less digits than its factorization.
5005051050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 901863 (or 901858 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 21.
The square root of 5005051050 is about 70746.3854200340. The cubic root of 5005051050 is about 1710.5515644889.
Adding to 5005051050 its reverse (501505005), we get a palindrome (5506556055).
The spelling of 5005051050 in words is "five billion, five million, fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •