Base | Representation |
---|---|
bin | 1011110001010000100… |
… | …1001011011100011101 |
3 | 201022220202122001222020 |
4 | 2330110021023130131 |
5 | 11303102030212110 |
6 | 232520130010353 |
7 | 20415511440615 |
oct | 2742411133435 |
9 | 638822561866 |
10 | 202201413405 |
11 | 78831476722 |
12 | 33230a169b9 |
13 | 160b5426c64 |
14 | 9b02609a45 |
15 | 53d686ed70 |
hex | 2f1424b71d |
202201413405 has 32 divisors (see below), whose sum is σ = 332856791424. Its totient is φ = 104739607296.
The previous prime is 202201413391. The next prime is 202201413419. The reversal of 202201413405 is 504314102202.
202201413405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (202201413391) and next prime (202201413419).
It is not a de Polignac number, because 202201413405 - 28 = 202201413149 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11094 + ... + 636023.
It is an arithmetic number, because the mean of its divisors is an integer number (10401774732).
Almost surely, 2202201413405 is an apocalyptic number.
It is an amenable number.
202201413405 is a deficient number, since it is larger than the sum of its proper divisors (130655378019).
202201413405 is a wasteful number, since it uses less digits than its factorization.
202201413405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 647725.
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 202201413405 its reverse (504314102202), we get a palindrome (706515515607).
The spelling of 202201413405 in words is "two hundred two billion, two hundred one million, four hundred thirteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •