Base | Representation |
---|---|
bin | 100101111111101100000… |
… | …0111110111110000001101 |
3 | 200111012220221100222001020 |
4 | 1023333120013313300031 |
5 | 1141024134332103134 |
6 | 15034543035104353 |
7 | 1046164206611265 |
oct | 113773007676015 |
9 | 20435827328036 |
10 | 5222011206669 |
11 | 1733708209054 |
12 | 704088ba20b9 |
13 | 2bb58365a28a |
14 | 140a64cc47a5 |
15 | 90c83289b49 |
hex | 4bfd81f7c0d |
5222011206669 has 16 divisors (see below), whose sum is σ = 7041028737600. Its totient is φ = 3442168515456.
The previous prime is 5222011206647. The next prime is 5222011206733. The reversal of 5222011206669 is 9666021102225.
It is not a de Polignac number, because 5222011206669 - 27 = 5222011206541 is a prime.
It is a super-2 number, since 2×52220112066692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5222011206669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5222011206619) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22026807 + ... + 22262619.
It is an arithmetic number, because the mean of its divisors is an integer number (440064296100).
Almost surely, 25222011206669 is an apocalyptic number.
It is an amenable number.
5222011206669 is a deficient number, since it is larger than the sum of its proper divisors (1819017530931).
5222011206669 is a wasteful number, since it uses less digits than its factorization.
5222011206669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318844.
The product of its (nonzero) digits is 155520, while the sum is 42.
It can be divided in two parts, 522201 and 1206669, that added together give a triangular number (1728870 = T1859).
The spelling of 5222011206669 in words is "five trillion, two hundred twenty-two billion, eleven million, two hundred six thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •