Base | Representation |
---|---|
bin | 100100101111101000110… |
… | …1101111111010001110001 |
3 | 122212210012111122020022221 |
4 | 1021133101231333101301 |
5 | 1130220103344112414 |
6 | 14423553010001041 |
7 | 1030600211541421 |
oct | 111372155772161 |
9 | 18783174566287 |
10 | 5050105066609 |
11 | 1677812721719 |
12 | 6968b1b76181 |
13 | 2a82b882c985 |
14 | 1365d8026481 |
15 | 8b57141c224 |
hex | 497d1b7f471 |
5050105066609 has 4 divisors (see below), whose sum is σ = 5224246620660. Its totient is φ = 4875963512560.
The previous prime is 5050105066579. The next prime is 5050105066673. The reversal of 5050105066609 is 9066605010505.
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 1717187472225 + 3332917594384 = 1310415^2 + 1825628^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050105066609 - 217 = 5050104935537 is a prime.
It is a super-2 number, since 2×50501050666092 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5050105061609) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87070776982 + ... + 87070777039.
It is an arithmetic number, because the mean of its divisors is an integer number (1306061655165).
Almost surely, 25050105066609 is an apocalyptic number.
It is an amenable number.
5050105066609 is a deficient number, since it is larger than the sum of its proper divisors (174141554051).
5050105066609 is a wasteful number, since it uses less digits than its factorization.
5050105066609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174141554050.
The product of its (nonzero) digits is 243000, while the sum is 43.
The spelling of 5050105066609 in words is "five trillion, fifty billion, one hundred five million, sixty-six thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •