Base | Representation |
---|---|
bin | 1010001011111111110101… |
… | …1101110110010101000111 |
3 | 1110122211100010112122212001 |
4 | 2202333331131312111013 |
5 | 2432010110420413111 |
6 | 35453435224010131 |
7 | 2234155655522215 |
oct | 242777535662507 |
9 | 43584303478761 |
10 | 11201232201031 |
11 | 362946361aa74 |
12 | 130aa5a000947 |
13 | 63336bb00462 |
14 | 2aa1dd169cb5 |
15 | 146582dca1c1 |
hex | a2ffd776547 |
11201232201031 has 32 divisors (see below), whose sum is σ = 12646990540800. Its totient is φ = 9880459142400.
The previous prime is 11201232201011. The next prime is 11201232201037. The reversal of 11201232201031 is 13010223210211.
It is a cyclic number.
It is not a de Polignac number, because 11201232201031 - 231 = 11199084717383 is a prime.
It is a super-2 number, since 2×112012322010312 (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 (11201232201037) 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, 3198456 + ... + 5712493.
It is an arithmetic number, because the mean of its divisors is an integer number (395218454400).
Almost surely, 211201232201031 is an apocalyptic number.
11201232201031 is a deficient number, since it is larger than the sum of its proper divisors (1445758339769).
11201232201031 is a wasteful number, since it uses less digits than its factorization.
11201232201031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8911087.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11201232201031 its reverse (13010223210211), we get a palindrome (24211455411242).
It can be divided in two parts, 11201 and 232201031, that added together give a palindrome (232212232).
The spelling of 11201232201031 in words is "eleven trillion, two hundred one billion, two hundred thirty-two million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •