Base | Representation |
---|---|
bin | 1001010100001011… |
… | …00001111010101111 |
3 | 110220112101011122000 |
4 | 10222011201322233 |
5 | 40220232410030 |
6 | 2144130023343 |
7 | 234634210620 |
oct | 45205417257 |
9 | 13815334560 |
10 | 5001060015 |
11 | 2136a71456 |
12 | b76a17b53 |
13 | 619140213 |
14 | 356299a47 |
15 | 1e40b5860 |
hex | 12a161eaf |
5001060015 has 128 divisors (see below), whose sum is σ = 10849075200. Its totient is φ = 2134823040.
The previous prime is 5001060013. The next prime is 5001060023. The reversal of 5001060015 is 5100601005.
5001060015 is a `hidden beast` number, since 50 + 0 + 1 + 0 + 600 + 15 = 666.
It is not a de Polignac number, because 5001060015 - 21 = 5001060013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5001060015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001060013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1272844 + ... + 1276766.
It is an arithmetic number, because the mean of its divisors is an integer number (84758400).
Almost surely, 25001060015 is an apocalyptic number.
5001060015 is an abundant number, since it is smaller than the sum of its proper divisors (5848015185).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001060015 is a wasteful number, since it uses less digits than its factorization.
5001060015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4034 (or 4028 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 5001060015 is about 70718.1731593796. The cubic root of 5001060015 is about 1710.0967781484.
The spelling of 5001060015 in words is "five billion, one million, sixty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •