Base | Representation |
---|---|
bin | 1010010001110101000100… |
… | …0111111110100000111101 |
3 | 1111000101221101120020200210 |
4 | 2210131101013332200331 |
5 | 2440130302010020331 |
6 | 40011444540143033 |
7 | 2244333503004411 |
oct | 244352107764075 |
9 | 44011841506623 |
10 | 11301420001341 |
11 | 36679a5a66238 |
12 | 132635a837a79 |
13 | 63c9474b5332 |
14 | 2b0dc5114d41 |
15 | 148e9885e446 |
hex | a47511fe83d |
11301420001341 has 8 divisors (see below), whose sum is σ = 15068717094304. Its totient is φ = 7534201454640.
The previous prime is 11301420001321. The next prime is 11301420001343. The reversal of 11301420001341 is 14310002410311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11301420001341 - 229 = 11300883130429 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 (11301420001343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19300015 + ... + 19876956.
It is an arithmetic number, because the mean of its divisors is an integer number (1883589636788).
Almost surely, 211301420001341 is an apocalyptic number.
It is an amenable number.
11301420001341 is a deficient number, since it is larger than the sum of its proper divisors (3767297092963).
11301420001341 is an equidigital number, since it uses as much as digits as its factorization.
11301420001341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39273131.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11301420001341 its reverse (14310002410311), we get a palindrome (25611422411652).
The spelling of 11301420001341 in words is "eleven trillion, three hundred one billion, four hundred twenty million, one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •