Base | Representation |
---|---|
bin | 1001010101101010… |
… | …00010110101111010 |
3 | 110221101210222112112 |
4 | 10222311002311322 |
5 | 40231430000032 |
6 | 2145253012322 |
7 | 235145115452 |
oct | 45265026572 |
9 | 13841728475 |
10 | 5013515642 |
11 | 2142aa9563 |
12 | b7b0240a2 |
13 | 61b8b1705 |
14 | 357bbcd62 |
15 | 1e52261b2 |
hex | 12ad42d7a |
5013515642 has 4 divisors (see below), whose sum is σ = 7520273466. Its totient is φ = 2506757820.
The previous prime is 5013515623. The next prime is 5013515653. The reversal of 5013515642 is 2465153105.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 2465153105 = 5 ⋅493030621.
It can be written as a sum of positive squares in only one way, i.e., 4861017841 + 152497801 = 69721^2 + 12349^2 .
It is a junction number, because it is equal to n+sod(n) for n = 5013515599 and 5013515608.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 1253378909 + ... + 1253378912.
Almost surely, 25013515642 is an apocalyptic number.
5013515642 is a deficient number, since it is larger than the sum of its proper divisors (2506757824).
5013515642 is a wasteful number, since it uses less digits than its factorization.
5013515642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2506757823.
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 5013515642 is about 70806.1836423910. The cubic root of 5013515642 is about 1711.5153219807.
Adding to 5013515642 its reverse (2465153105), we get a palindrome (7478668747).
The spelling of 5013515642 in words is "five billion, thirteen million, five hundred fifteen thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •