Base | Representation |
---|---|
bin | 1010001100000010110001… |
… | …1011111101000011010111 |
3 | 1110122220101001100212002020 |
4 | 2203000230123331003113 |
5 | 2432013214134432211 |
6 | 35454045334144223 |
7 | 2234214334632606 |
oct | 243005433750327 |
9 | 43586331325066 |
10 | 11202020233431 |
11 | 3629828427415 |
12 | 130b039ab2073 |
13 | 633466153011 |
14 | 2aa275a9ba3d |
15 | 1465cc18b306 |
hex | a302c6fd0d7 |
11202020233431 has 32 divisors (see below), whose sum is σ = 15454059724800. Its totient is φ = 7210133145600.
The previous prime is 11202020233399. The next prime is 11202020233489. The reversal of 11202020233431 is 13433202020211.
11202020233431 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 11202020233431 - 25 = 11202020233399 is a prime.
It is a super-2 number, since 2×112020202334312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202020233031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 670650826 + ... + 670667528.
It is an arithmetic number, because the mean of its divisors is an integer number (482939366400).
Almost surely, 211202020233431 is an apocalyptic number.
11202020233431 is a deficient number, since it is larger than the sum of its proper divisors (4252039491369).
11202020233431 is a wasteful number, since it uses less digits than its factorization.
11202020233431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33247.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 11202020233431 its reverse (13433202020211), we get a palindrome (24635222253642).
The spelling of 11202020233431 in words is "eleven trillion, two hundred two billion, twenty million, two hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •