Base | Representation |
---|---|
bin | 1010010111101011110001… |
… | …0111010110001000001101 |
3 | 1111101000120020001100111221 |
4 | 2211322330113112020031 |
5 | 2443302300340041031 |
6 | 40130001424243341 |
7 | 2254524163064566 |
oct | 245727427261015 |
9 | 44330506040457 |
10 | 11402003440141 |
11 | 36a6620768566 |
12 | 134194ba70551 |
13 | 649286b42522 |
14 | 2b5c0784b16d |
15 | 14b8d3de4a11 |
hex | a5ebc5d620d |
11402003440141 has 8 divisors (see below), whose sum is σ = 11615201880480. Its totient is φ = 11190070273008.
The previous prime is 11402003440133. The next prime is 11402003440153. The reversal of 11402003440141 is 14104430020411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11402003440141 - 23 = 11402003440133 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 (11402003440111) 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, 316300111 + ... + 316336156.
It is an arithmetic number, because the mean of its divisors is an integer number (1451900235060).
Almost surely, 211402003440141 is an apocalyptic number.
It is an amenable number.
11402003440141 is a deficient number, since it is larger than the sum of its proper divisors (213198440339).
11402003440141 is an equidigital number, since it uses as much as digits as its factorization.
11402003440141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632636603.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 11402003440141 its reverse (14104430020411), we get a palindrome (25506433460552).
The spelling of 11402003440141 in words is "eleven trillion, four hundred two billion, three million, four hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •