Base | Representation |
---|---|
bin | 1010000110110000011100… |
… | …1100110101101101101001 |
3 | 1110100012221201022222200110 |
4 | 2201230013030311231221 |
5 | 2424021220001413001 |
6 | 35344225415124533 |
7 | 2224520631613446 |
oct | 241540714655551 |
9 | 43305851288613 |
10 | 11111201201001 |
11 | 35a4263456120 |
12 | 12b5512973749 |
13 | 627a21745c85 |
14 | 2a5adc0bc9cd |
15 | 144063e783d6 |
hex | a1b07335b69 |
11111201201001 has 16 divisors (see below), whose sum is σ = 16170612756480. Its totient is φ = 6730367352720.
The previous prime is 11111201200963. The next prime is 11111201201011. The reversal of 11111201201001 is 10010210211111.
11111201201001 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 11111201201001 - 27 = 11111201200873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11111201201011) 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, 92288461 + ... + 92408778.
It is an arithmetic number, because the mean of its divisors is an integer number (1010663297280).
Almost surely, 211111201201001 is an apocalyptic number.
11111201201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11111201201001 is a deficient number, since it is larger than the sum of its proper divisors (5059411555479).
11111201201001 is a wasteful number, since it uses less digits than its factorization.
11111201201001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184699076.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11111201201001 its reverse (10010210211111), we get a palindrome (21121411412112).
The spelling of 11111201201001 in words is "eleven trillion, one hundred eleven billion, two hundred one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •