Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …1001111110011101011101 |
3 | 1110022011022012211111222022 |
4 | 2201201301221332131131 |
5 | 2423331002143301023 |
6 | 35335152215425525 |
7 | 2223645611654615 |
oct | 241416151763535 |
9 | 43264265744868 |
10 | 11100102322013 |
11 | 359a588422061 |
12 | 12b33359852a5 |
13 | 6269731ab163 |
14 | 2a536802da45 |
15 | 143b148a67c8 |
hex | a1871a7e75d |
11100102322013 has 8 divisors (see below), whose sum is σ = 11143940499648. Its totient is φ = 11056276512064.
The previous prime is 11100102322003. The next prime is 11100102322039. The reversal of 11100102322013 is 31022320100111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11100102322013 - 224 = 11100085544797 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11100102321982 and 11100102322000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100102322003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1291295 + ... + 4885452.
It is an arithmetic number, because the mean of its divisors is an integer number (1392992562456).
Almost surely, 211100102322013 is an apocalyptic number.
It is an amenable number.
11100102322013 is a deficient number, since it is larger than the sum of its proper divisors (43838177635).
11100102322013 is an equidigital number, since it uses as much as digits as its factorization.
11100102322013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6183843.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11100102322013 its reverse (31022320100111), we get a palindrome (42122422422124).
The spelling of 11100102322013 in words is "eleven trillion, one hundred billion, one hundred two million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •