Base | Representation |
---|---|
bin | 1001100000100100… |
… | …11101111110000111 |
3 | 111011210011201020220 |
4 | 10300102131332013 |
5 | 40423402140030 |
6 | 2202324155423 |
7 | 240336522150 |
oct | 46022357607 |
9 | 14153151226 |
10 | 5105115015 |
11 | 218a782520 |
12 | ba5838b73 |
13 | 634873620 |
14 | 366024927 |
15 | 1ed2bba10 |
hex | 13049df87 |
5105115015 has 128 divisors (see below), whose sum is σ = 11223539712. Its totient is φ = 1912619520.
The previous prime is 5105115013. The next prime is 5105115047.
5105115015 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5105115015 - 21 = 5105115013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105115013) 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, 641692 + ... + 649598.
It is an arithmetic number, because the mean of its divisors is an integer number (87683904).
Almost surely, 25105115015 is an apocalyptic number.
5105115015 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5105115015 is an abundant number, since it is smaller than the sum of its proper divisors (6118424697).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5105115015 is a wasteful number, since it uses less digits than its factorization.
5105115015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7989.
The product of its (nonzero) digits is 625, while the sum is 24.
The square root of 5105115015 is about 71450.0875786727. The cubic root of 5105115015 is about 1721.8758845608.
It can be divided in two parts, 51051 and 15015, that added together give a palindrome (66066).
The spelling of 5105115015 in words is "five billion, one hundred five million, one hundred fifteen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •