Base | Representation |
---|---|
bin | 1010010001011100… |
… | …11110100011110001 |
3 | 112020100122122112002 |
4 | 11020232132203301 |
5 | 42243332020031 |
6 | 2311131543345 |
7 | 253445444525 |
oct | 51056364361 |
9 | 15210578462 |
10 | 5515110641 |
11 | 2380155287 |
12 | 109abbab55 |
13 | 69b7a47a1 |
14 | 3a466bd85 |
15 | 2242a6ccb |
hex | 148b9e8f1 |
5515110641 has 24 divisors (see below), whose sum is σ = 6189172704. Its totient is φ = 4894606080.
The previous prime is 5515110617. The next prime is 5515110649. The reversal of 5515110641 is 1460115155.
It is not a de Polignac number, because 5515110641 - 26 = 5515110577 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5515110649) 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 23 ways as a sum of consecutive naturals, for example, 610286 + ... + 619256.
It is an arithmetic number, because the mean of its divisors is an integer number (257882196).
Almost surely, 25515110641 is an apocalyptic number.
It is an amenable number.
5515110641 is a deficient number, since it is larger than the sum of its proper divisors (674062063).
5515110641 is a wasteful number, since it uses less digits than its factorization.
5515110641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9089 (or 9060 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 29.
The square root of 5515110641 is about 74263.7909145500. The cubic root of 5515110641 is about 1766.7892296877.
Adding to 5515110641 its reverse (1460115155), we get a palindrome (6975225796).
The spelling of 5515110641 in words is "five billion, five hundred fifteen million, one hundred ten thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •