Base | Representation |
---|---|
bin | 100010111011011000010… |
… | …010001110000110101111 |
3 | 22111110101111011000102011 |
4 | 202323120102032012233 |
5 | 303311122410444231 |
6 | 5034351313142051 |
7 | 335260461553516 |
oct | 42733022160657 |
9 | 8443344130364 |
10 | 2400220406191 |
11 | 845a22933663 |
12 | 329218b5a927 |
13 | 145455752c7a |
14 | 8425802767d |
15 | 4267de119b1 |
hex | 22ed848e1af |
2400220406191 has 8 divisors (see below), whose sum is σ = 2444878553040. Its totient is φ = 2355973855488.
The previous prime is 2400220406183. The next prime is 2400220406209. The reversal of 2400220406191 is 1916040220042.
2400220406191 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2400220406191 - 23 = 2400220406183 is a prime.
It is a super-2 number, since 2×24002204061912 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2400220406791) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102887266 + ... + 102910591.
It is an arithmetic number, because the mean of its divisors is an integer number (305609819130).
Almost surely, 22400220406191 is an apocalyptic number.
2400220406191 is a deficient number, since it is larger than the sum of its proper divisors (44658146849).
2400220406191 is a wasteful number, since it uses less digits than its factorization.
2400220406191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205798073.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 2400220406191 in words is "two trillion, four hundred billion, two hundred twenty million, four hundred six thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •