Base | Representation |
---|---|
bin | 1011100110101011… |
… | …1110011000001001 |
3 | 22001002111221221221 |
4 | 2321222332120021 |
5 | 22334423104010 |
6 | 1233034202041 |
7 | 140123330620 |
oct | 27152763011 |
9 | 8032457857 |
10 | 3115050505 |
11 | 1359401606 |
12 | 72b283321 |
13 | 3a8497668 |
14 | 2179d46b7 |
15 | 13371cdda |
hex | b9abe609 |
3115050505 has 64 divisors (see below), whose sum is σ = 4675207680. Its totient is φ = 1943875584.
The previous prime is 3115050467. The next prime is 3115050529. The reversal of 3115050505 is 5050505113.
It is not a de Polignac number, because 3115050505 - 211 = 3115048457 is a prime.
3115050505 is a modest number, since divided by 50505 gives 3115 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 3115050505.
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 in 63 ways as a sum of consecutive naturals, for example, 2788207 + ... + 2789323.
It is an arithmetic number, because the mean of its divisors is an integer number (73050120).
Almost surely, 23115050505 is an apocalyptic number.
3115050505 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3115050505 is a deficient number, since it is larger than the sum of its proper divisors (1560157175).
3115050505 is a wasteful number, since it uses less digits than its factorization.
3115050505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1298.
The product of its (nonzero) digits is 1875, while the sum is 25.
The square root of 3115050505 is about 55812.6375026302. The cubic root of 3115050505 is about 1460.4556195135.
Adding to 3115050505 its reverse (5050505113), we get a palindrome (8165555618).
The spelling of 3115050505 in words is "three billion, one hundred fifteen million, fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •