Base | Representation |
---|---|
bin | 1010010111110011101111… |
… | …1010010110000100111001 |
3 | 1111101020002100121120202102 |
4 | 2211330323322112010321 |
5 | 2443321141142241101 |
6 | 40130554025313145 |
7 | 2254631205553505 |
oct | 245747372260471 |
9 | 44336070546672 |
10 | 11404143321401 |
11 | 36a7519665a76 |
12 | 13422486357b5 |
13 | 649538284b5c |
14 | 2b5d6bb19305 |
15 | 14b9abbd886b |
hex | a5f3be96139 |
11404143321401 has 4 divisors (see below), whose sum is σ = 11491197850704. Its totient is φ = 11317088792100.
The previous prime is 11404143321323. The next prime is 11404143321407. The reversal of 11404143321401 is 10412334140411.
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 11404143321401 - 226 = 11404076212537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11404143321407) 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, 43527264455 + ... + 43527264716.
It is an arithmetic number, because the mean of its divisors is an integer number (2872799462676).
Almost surely, 211404143321401 is an apocalyptic number.
It is an amenable number.
11404143321401 is a deficient number, since it is larger than the sum of its proper divisors (87054529303).
11404143321401 is an equidigital number, since it uses as much as digits as its factorization.
11404143321401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87054529302.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 11404143321401 its reverse (10412334140411), we get a palindrome (21816477461812).
The spelling of 11404143321401 in words is "eleven trillion, four hundred four billion, one hundred forty-three million, three hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •