Base | Representation |
---|---|
bin | 100100011101010001000… |
… | …0010111111011001101001 |
3 | 122202000100212000122020021 |
4 | 1020322202002333121221 |
5 | 1124043303020410410 |
6 | 14353505555000441 |
7 | 1025002410012601 |
oct | 110724202773151 |
9 | 18660325018207 |
10 | 5010650560105 |
11 | 1662006682a53 |
12 | 68b120899121 |
13 | 2a466b7a0638 |
14 | 134734093c01 |
15 | 8a512787eda |
hex | 48ea20bf669 |
5010650560105 has 4 divisors (see below), whose sum is σ = 6012780672132. Its totient is φ = 4008520448080.
The previous prime is 5010650560099. The next prime is 5010650560169.
5010650560105 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 517149395161 + 4493501164944 = 719131^2 + 2119788^2 .
It is not a de Polignac number, because 5010650560105 - 223 = 5010642171497 is a prime.
It is a super-2 number, since 2×50106505601052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501065056006 + ... + 501065056015.
It is an arithmetic number, because the mean of its divisors is an integer number (1503195168033).
Almost surely, 25010650560105 is an apocalyptic number.
It is an amenable number.
5010650560105 is a deficient number, since it is larger than the sum of its proper divisors (1002130112027).
5010650560105 is a wasteful number, since it uses less digits than its factorization.
5010650560105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002130112026.
The product of its (nonzero) digits is 22500, while the sum is 34.
It can be divided in two parts, 5010650 and 560105, that added together give a palindrome (5570755).
The spelling of 5010650560105 in words is "five trillion, ten billion, six hundred fifty million, five hundred sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •