Base | Representation |
---|---|
bin | 1001010101010011… |
… | …10001010000110011 |
3 | 110221012020211020012 |
4 | 10222221301100303 |
5 | 40230200410201 |
6 | 2145105405135 |
7 | 235111025540 |
oct | 45251612063 |
9 | 13835224205 |
10 | 5010560051 |
11 | 214136aa22 |
12 | b7a0397ab |
13 | 61b0b8343 |
14 | 35764dbc7 |
15 | 1e4d405bb |
hex | 12aa71433 |
5010560051 has 8 divisors (see below), whose sum is σ = 5975326464. Its totient is φ = 4108036680.
The previous prime is 5010560041. The next prime is 5010560063. The reversal of 5010560051 is 1500650105.
5010560051 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5010560051 - 26 = 5010559987 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5010559999 and 5010560026.
It is not an unprimeable number, because it can be changed into a prime (5010560041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15560585 + ... + 15560906.
It is an arithmetic number, because the mean of its divisors is an integer number (746915808).
Almost surely, 25010560051 is an apocalyptic number.
5010560051 is a deficient number, since it is larger than the sum of its proper divisors (964766413).
5010560051 is a wasteful number, since it uses less digits than its factorization.
5010560051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31121521.
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 5010560051 is about 70785.3095705599. The cubic root of 5010560051 is about 1711.1789290505.
The spelling of 5010560051 in words is "five billion, ten million, five hundred sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •