Base | Representation |
---|---|
bin | 1010001011111111011011… |
… | …0111010011000010101001 |
3 | 1110122211001102002222221000 |
4 | 2202333312313103002221 |
5 | 2432004344041303341 |
6 | 35453420225505213 |
7 | 2234153142144504 |
oct | 242776667230251 |
9 | 43584042088830 |
10 | 11201121431721 |
11 | 3629407043391 |
12 | 130aa28aa2209 |
13 | 633351b88ba0 |
14 | 2aa1cc57413b |
15 | 1465782e98b6 |
hex | a2ff6dd30a9 |
11201121431721 has 32 divisors (see below), whose sum is σ = 17871063678720. Its totient is φ = 6892871046912.
The previous prime is 11201121431701. The next prime is 11201121431837. The reversal of 11201121431721 is 12713412110211.
11201121431721 is a `hidden beast` number, since 1 + 1 + 201 + 1 + 2 + 1 + 431 + 7 + 21 = 666.
It is not a de Polignac number, because 11201121431721 - 218 = 11201121169577 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (11201121431701) 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, 21024001 + ... + 21550193.
It is an arithmetic number, because the mean of its divisors is an integer number (558470739960).
Almost surely, 211201121431721 is an apocalyptic number.
It is an amenable number.
11201121431721 is a deficient number, since it is larger than the sum of its proper divisors (6669942246999).
11201121431721 is a wasteful number, since it uses less digits than its factorization.
11201121431721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586862 (or 586856 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
Adding to 11201121431721 its reverse (12713412110211), we get a palindrome (23914533541932).
The spelling of 11201121431721 in words is "eleven trillion, two hundred one billion, one hundred twenty-one million, four hundred thirty-one thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •