Base | Representation |
---|---|
bin | 1010001000011101001111… |
… | …0000111001101011111101 |
3 | 1110110000022211200121021001 |
4 | 2202013103300321223331 |
5 | 2430011021132312201 |
6 | 35405455215210301 |
7 | 2226603400112635 |
oct | 242072360715375 |
9 | 43400284617231 |
10 | 11140403010301 |
11 | 3605689084714 |
12 | 12bb102516991 |
13 | 62a6c663c886 |
14 | 2a72ac50d6c5 |
15 | 144bc2986301 |
hex | a21d3c39afd |
11140403010301 has 8 divisors (see below), whose sum is σ = 11377788652800. Its totient is φ = 10903032192528.
The previous prime is 11140403010299. The next prime is 11140403010307. The reversal of 11140403010301 is 10301030404111.
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 11140403010301 - 21 = 11140403010299 is a prime.
It is a super-2 number, since 2×111404030103012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140403010307) 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, 2180601 + ... + 5199598.
It is an arithmetic number, because the mean of its divisors is an integer number (1422223581600).
Almost surely, 211140403010301 is an apocalyptic number.
It is an amenable number.
11140403010301 is a deficient number, since it is larger than the sum of its proper divisors (237385642499).
11140403010301 is an equidigital number, since it uses as much as digits as its factorization.
11140403010301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7412363.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11140403010301 its reverse (10301030404111), we get a palindrome (21441433414412).
The spelling of 11140403010301 in words is "eleven trillion, one hundred forty billion, four hundred three million, ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •