Base | Representation |
---|---|
bin | 1001010101011000… |
… | …11011010010100001 |
3 | 110221020120012112220 |
4 | 10222230123102201 |
5 | 40230340201411 |
6 | 2145132341253 |
7 | 235116656130 |
oct | 45254332241 |
9 | 13836505486 |
10 | 5011256481 |
11 | 21417a6190 |
12 | b7a314829 |
13 | 61b2a032a |
14 | 357791917 |
15 | 1e4e2bb06 |
hex | 12ab1b4a1 |
5011256481 has 32 divisors (see below), whose sum is σ = 8820430848. Its totient is φ = 2450115840.
The previous prime is 5011256473. The next prime is 5011256483. The reversal of 5011256481 is 1846521105.
It is not a de Polignac number, because 5011256481 - 23 = 5011256473 is a prime.
It is a super-2 number, since 2×50112564812 = 50225383036729006722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5011256483) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 634125 + ... + 641978.
It is an arithmetic number, because the mean of its divisors is an integer number (275638464).
Almost surely, 25011256481 is an apocalyptic number.
5011256481 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5011256481 is a deficient number, since it is larger than the sum of its proper divisors (3809174367).
5011256481 is a wasteful number, since it uses less digits than its factorization.
5011256481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1276141.
The product of its (nonzero) digits is 9600, while the sum is 33.
The square root of 5011256481 is about 70790.2287113130. The cubic root of 5011256481 is about 1711.2582056929.
Adding to 5011256481 its reverse (1846521105), we get a palindrome (6857777586).
The spelling of 5011256481 in words is "five billion, eleven million, two hundred fifty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •