Base | Representation |
---|---|
bin | 100100011011011010001… |
… | …1111111010100011111010 |
3 | 122201122002002210121000000 |
4 | 1020312310133322203322 |
5 | 1124012122240240200 |
6 | 14352010310053430 |
7 | 1024501554505203 |
oct | 110666437724372 |
9 | 18648062717000 |
10 | 5006665165050 |
11 | 1660350a6472a |
12 | 68a3aa04a276 |
13 | 2a4184bc3803 |
14 | 134476a625aa |
15 | 8a37c94a300 |
hex | 48db47fa8fa |
5006665165050 has 84 divisors (see below), whose sum is σ = 13962208808430. Its totient is φ = 1335110700960.
The previous prime is 5006665165027. The next prime is 5006665165091. The reversal of 5006665165050 is 505615666005.
It can be written as a sum of positive squares in 3 ways, for example, as 2748927524121 + 2257737640929 = 1657989^2 + 1502577^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 5006665164987 and 5006665165005.
It is an unprimeable number.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 68642085 + ... + 68714984.
Almost surely, 25006665165050 is an apocalyptic number.
5006665165050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5006665165050 is an abundant number, since it is smaller than the sum of its proper divisors (8955543643380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5006665165050 is a wasteful number, since it uses less digits than its factorization.
5006665165050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137357099 (or 137357079 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 45.
It can be divided in two parts, 5006665 and 165050, that added together give a palindrome (5171715).
The spelling of 5006665165050 in words is "five trillion, six billion, six hundred sixty-five million, one hundred sixty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •