Base | Representation |
---|---|
bin | 1010000110000111110110… |
… | …1000011000100011101101 |
3 | 1110022011211012212202120210 |
4 | 2201201331220120203231 |
5 | 2423331410111344323 |
6 | 35335224153533033 |
7 | 2223653601450000 |
oct | 241417550304355 |
9 | 43264735782523 |
10 | 11100303231213 |
11 | 359a680876119 |
12 | 12b3391114179 |
13 | 6269a59c3241 |
14 | 2a53869ab537 |
15 | 143b27340293 |
hex | a187da188ed |
11100303231213 has 20 divisors (see below), whose sum is σ = 17266110993088. Its totient is φ = 6343030413720.
The previous prime is 11100303231209. The next prime is 11100303231223. The reversal of 11100303231213 is 31213230300111.
It is a happy number.
It is not a de Polignac number, because 11100303231213 - 22 = 11100303231209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11100303231213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100303231223) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 770526133 + ... + 770540538.
Almost surely, 211100303231213 is an apocalyptic number.
It is an amenable number.
11100303231213 is a deficient number, since it is larger than the sum of its proper divisors (6165807761875).
11100303231213 is an frugal number, since it uses more digits than its factorization.
11100303231213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1541066702 (or 1541066681 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11100303231213 its reverse (31213230300111), we get a palindrome (42313533531324).
The spelling of 11100303231213 in words is "eleven trillion, one hundred billion, three hundred three million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •