Base | Representation |
---|---|
bin | 1010000010101100011111… |
… | …1111101001011010011001 |
3 | 1110002112211122010210210112 |
4 | 2200223013333221122121 |
5 | 2421400312323121101 |
6 | 35252205305454105 |
7 | 2216500466346101 |
oct | 240530777513231 |
9 | 43075748123715 |
10 | 11041421301401 |
11 | 3577705525807 |
12 | 12a3a997a1335 |
13 | 621280aa295a |
14 | 2a259c7dc201 |
15 | 14232cd426bb |
hex | a0ac7fe9699 |
11041421301401 has 8 divisors (see below), whose sum is σ = 11084251296384. Its totient is φ = 10998670991760.
The previous prime is 11041421301397. The next prime is 11041421301431. The reversal of 11041421301401 is 10410312414011.
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 11041421301401 - 22 = 11041421301397 is a prime.
It is a super-3 number, since 3×110414213014013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11041421301431) 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, 19643666 + ... + 20197931.
It is an arithmetic number, because the mean of its divisors is an integer number (1385531412048).
Almost surely, 211041421301401 is an apocalyptic number.
It is an amenable number.
11041421301401 is a deficient number, since it is larger than the sum of its proper divisors (42829994983).
11041421301401 is an equidigital number, since it uses as much as digits as its factorization.
11041421301401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39842671.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 11041421301401 its reverse (10410312414011), we get a palindrome (21451733715412).
The spelling of 11041421301401 in words is "eleven trillion, forty-one billion, four hundred twenty-one million, three hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •