Base | Representation |
---|---|
bin | 1001010100001100… |
… | …00100011100000111 |
3 | 110220112122100121001 |
4 | 10222012010130013 |
5 | 40220301421130 |
6 | 2144133034131 |
7 | 234635340100 |
oct | 45206043407 |
9 | 13815570531 |
10 | 5001201415 |
11 | 2137058711 |
12 | b76a85947 |
13 | 61918c6a2 |
14 | 3562d53a7 |
15 | 1e40e26ca |
hex | 12a184707 |
5001201415 has 24 divisors (see below), whose sum is σ = 6986518272. Its totient is φ = 3426816960.
The previous prime is 5001201391. The next prime is 5001201433. The reversal of 5001201415 is 5141021005.
It is not a de Polignac number, because 5001201415 - 25 = 5001201383 is a prime.
It is a super-3 number, since 3×50012014153 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5001201392 and 5001201401.
It is a congruent number.
It is an unprimeable number.
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, 353457 + ... + 367333.
It is an arithmetic number, because the mean of its divisors is an integer number (291104928).
Almost surely, 25001201415 is an apocalyptic number.
5001201415 is a deficient number, since it is larger than the sum of its proper divisors (1985316857).
5001201415 is a wasteful number, since it uses less digits than its factorization.
5001201415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15367 (or 15360 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 19.
The square root of 5001201415 is about 70719.1728953330. The cubic root of 5001201415 is about 1710.1128950920.
The spelling of 5001201415 in words is "five billion, one million, two hundred one thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •