Base | Representation |
---|---|
bin | 1010000000010110011110… |
… | …1000110111111100010101 |
3 | 1102221200220001121101212002 |
4 | 2200011213220313330111 |
5 | 2420220323400410310 |
6 | 35221505240205045 |
7 | 2213543516140442 |
oct | 240054750677425 |
9 | 42850801541762 |
10 | 11001150013205 |
11 | 356161a423950 |
12 | 129811aa69785 |
13 | 61a533766141 |
14 | 2a065c1b29c9 |
15 | 14127261dda5 |
hex | a0167a37f15 |
11001150013205 has 16 divisors (see below), whose sum is σ = 15248652853824. Its totient is φ = 7530198938880.
The previous prime is 11001150013199. The next prime is 11001150013213. The reversal of 11001150013205 is 50231005110011.
It is a happy number.
11001150013205 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 11001150013205 - 232 = 10996855045909 is a prime.
It is a super-2 number, since 2×110011500132052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5882966987 + ... + 5882968856.
It is an arithmetic number, because the mean of its divisors is an integer number (953040803364).
Almost surely, 211001150013205 is an apocalyptic number.
It is an amenable number.
11001150013205 is a deficient number, since it is larger than the sum of its proper divisors (4247502840619).
11001150013205 is a wasteful number, since it uses less digits than its factorization.
11001150013205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11765935876.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 11001150013205 its reverse (50231005110011), we get a palindrome (61232155123216).
The spelling of 11001150013205 in words is "eleven trillion, one billion, one hundred fifty million, thirteen thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •