Base | Representation |
---|---|
bin | 11101001000101111000… |
… | …011101110100110100101 |
3 | 21002102010211211101201001 |
4 | 131020233003232212211 |
5 | 230301044013011110 |
6 | 4131452431233301 |
7 | 264441323311555 |
oct | 35105703564645 |
9 | 7072124741631 |
10 | 2002244266405 |
11 | 702168765409 |
12 | 28406b678831 |
13 | 116a704c4466 |
14 | 6cca2971165 |
15 | 3713a04063a |
hex | 1d22f0ee9a5 |
2002244266405 has 8 divisors (see below), whose sum is σ = 2402852108184. Its totient is φ = 1601689420800.
The previous prime is 2002244266303. The next prime is 2002244266427. The reversal of 2002244266405 is 5046624422002.
It can be written as a sum of positive squares in 4 ways, for example, as 814417444 + 2001429848961 = 28538^2 + 1414719^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2002244266405 - 219 = 2002243742117 is a prime.
It is a super-2 number, since 2×20022442664052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13165876 + ... + 13317085.
It is an arithmetic number, because the mean of its divisors is an integer number (300356513523).
Almost surely, 22002244266405 is an apocalyptic number.
It is an amenable number.
2002244266405 is a deficient number, since it is larger than the sum of its proper divisors (400607841779).
2002244266405 is a wasteful number, since it uses less digits than its factorization.
2002244266405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26498087.
The product of its (nonzero) digits is 184320, while the sum is 37.
Adding to 2002244266405 its reverse (5046624422002), we get a palindrome (7048868688407).
The spelling of 2002244266405 in words is "two trillion, two billion, two hundred forty-four million, two hundred sixty-six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •