Base | Representation |
---|---|
bin | 1010000110000111001101… |
… | …0100000001100100011101 |
3 | 1110022011101011010220101221 |
4 | 2201201303110001210131 |
5 | 2423331031302401023 |
6 | 35335155051333341 |
7 | 2223646400161312 |
oct | 241416324014435 |
9 | 43264334126357 |
10 | 11100130122013 |
11 | 359a5a208a669 |
12 | 12b3343151251 |
13 | 626978b9296a |
14 | 2a536b9c8d09 |
15 | 143b1704885d |
hex | a187350191d |
11100130122013 has 4 divisors (see below), whose sum is σ = 11582744475168. Its totient is φ = 10617515768860.
The previous prime is 11100130121981. The next prime is 11100130122049. The reversal of 11100130122013 is 31022103100111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11100130122013 - 25 = 11100130121981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100130125013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 241307176543 + ... + 241307176588.
It is an arithmetic number, because the mean of its divisors is an integer number (2895686118792).
Almost surely, 211100130122013 is an apocalyptic number.
It is an amenable number.
11100130122013 is a deficient number, since it is larger than the sum of its proper divisors (482614353155).
11100130122013 is an equidigital number, since it uses as much as digits as its factorization.
11100130122013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482614353154.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11100130122013 its reverse (31022103100111), we get a palindrome (42122233222124).
The spelling of 11100130122013 in words is "eleven trillion, one hundred billion, one hundred thirty million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •