Base | Representation |
---|---|
bin | 100100111000101111111… |
… | …0001011111100101000001 |
3 | 122221122200220011100121001 |
4 | 1021301133301133211001 |
5 | 1131030140031003301 |
6 | 14440550132132001 |
7 | 1032162050565625 |
oct | 111613761374501 |
9 | 18848626140531 |
10 | 5069668219201 |
11 | 16850415a8823 |
12 | 69a651767001 |
13 | 2aa0b5864401 |
14 | 1375322b5185 |
15 | 8bd18b46c01 |
hex | 49c5fc5f941 |
5069668219201 has 8 divisors (see below), whose sum is σ = 5085882383400. Its totient is φ = 5053460982528.
The previous prime is 5069668219199. The next prime is 5069668219219. The reversal of 5069668219201 is 1029128669605.
It can be written as a sum of positive squares in 4 ways, for example, as 639384148225 + 4430284070976 = 799615^2 + 2104824^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5069668219201 - 21 = 5069668219199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5069668219501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263926 + ... + 3195151.
It is an arithmetic number, because the mean of its divisors is an integer number (635735297925).
Almost surely, 25069668219201 is an apocalyptic number.
It is an amenable number.
5069668219201 is a deficient number, since it is larger than the sum of its proper divisors (16214164199).
5069668219201 is a wasteful number, since it uses less digits than its factorization.
5069668219201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3463763.
The product of its (nonzero) digits is 2799360, while the sum is 55.
The spelling of 5069668219201 in words is "five trillion, sixty-nine billion, six hundred sixty-eight million, two hundred nineteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •