Base | Representation |
---|---|
bin | 100010111011011000010… |
… | …010001110000111001111 |
3 | 22111110101111011000110100 |
4 | 202323120102032013033 |
5 | 303311122410444343 |
6 | 5034351313142143 |
7 | 335260461553563 |
oct | 42733022160717 |
9 | 8443344130410 |
10 | 2400220406223 |
11 | 845a22933692 |
12 | 329218b5a953 |
13 | 145455752ca3 |
14 | 842580276a3 |
15 | 4267de119d3 |
hex | 22ed848e1cf |
2400220406223 has 6 divisors (see below), whose sum is σ = 3466985031224. Its totient is φ = 1600146937476.
The previous prime is 2400220406209. The next prime is 2400220406231. The reversal of 2400220406223 is 3226040220042.
It is a happy number.
2400220406223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2400220406223 - 210 = 2400220405199 is a prime.
It is a super-2 number, since 2×24002204062232 (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 (2400220401223) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 133345578115 + ... + 133345578132.
Almost surely, 22400220406223 is an apocalyptic number.
2400220406223 is a deficient number, since it is larger than the sum of its proper divisors (1066764625001).
2400220406223 is a wasteful number, since it uses less digits than its factorization.
2400220406223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266691156253 (or 266691156250 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
Adding to 2400220406223 its reverse (3226040220042), we get a palindrome (5626260626265).
The spelling of 2400220406223 in words is "two trillion, four hundred billion, two hundred twenty million, four hundred six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •