Base | Representation |
---|---|
bin | 1010001100100000100000… |
… | …1000001101001000000001 |
3 | 1110200122222020121101001002 |
4 | 2203020020020031020001 |
5 | 2432131040224324301 |
6 | 35501445310021345 |
7 | 2234616163263356 |
oct | 243101010151001 |
9 | 43618866541032 |
10 | 11210001011201 |
11 | 3632153365923 |
12 | 13106a67a7855 |
13 | 6341386c5a25 |
14 | 2aa7d19a062d |
15 | 1468e7b3b16b |
hex | a320820d201 |
11210001011201 has 16 divisors (see below), whose sum is σ = 11537917110720. Its totient is φ = 10886695166400.
The previous prime is 11210001011197. The next prime is 11210001011207. The reversal of 11210001011201 is 10211010001211.
It is a cyclic number.
It is not a de Polignac number, because 11210001011201 - 22 = 11210001011197 is a prime.
It is a super-2 number, since 2×112100010112012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11210001011207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130711931 + ... + 130797663.
It is an arithmetic number, because the mean of its divisors is an integer number (721119819420).
Almost surely, 211210001011201 is an apocalyptic number.
It is an amenable number.
11210001011201 is a deficient number, since it is larger than the sum of its proper divisors (327916099519).
11210001011201 is an equidigital number, since it uses as much as digits as its factorization.
11210001011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112576.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11210001011201 its reverse (10211010001211), we get a palindrome (21421011012412).
It can be divided in two parts, 112100010 and 11201, that added together give a palindrome (112111211).
The spelling of 11210001011201 in words is "eleven trillion, two hundred ten billion, one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •