Base | Representation |
---|---|
bin | 1010011010000001010001… |
… | …0011001001011110010011 |
3 | 1111111212010221201120211221 |
4 | 2212200110103021132103 |
5 | 2444431442130043103 |
6 | 40200235445345511 |
7 | 2260444506340111 |
oct | 246402423113623 |
9 | 44455127646757 |
10 | 11442133440403 |
11 | 3711644038736 |
12 | 134968b408297 |
13 | 64ccb0b10703 |
14 | 2b7b333b8ab1 |
15 | 14c98200a1bd |
hex | a68144c9793 |
11442133440403 has 8 divisors (see below), whose sum is σ = 11856435008000. Its totient is φ = 11034568483848.
The previous prime is 11442133440391. The next prime is 11442133440461. The reversal of 11442133440403 is 30404433124411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11442133440403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11442133440503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1684149303 + ... + 1684156096.
It is an arithmetic number, because the mean of its divisors is an integer number (1482054376000).
Almost surely, 211442133440403 is an apocalyptic number.
11442133440403 is a deficient number, since it is larger than the sum of its proper divisors (414301567597).
11442133440403 is an equidigital number, since it uses as much as digits as its factorization.
11442133440403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3368305521.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 11442133440403 its reverse (30404433124411), we get a palindrome (41846566564814).
The spelling of 11442133440403 in words is "eleven trillion, four hundred forty-two billion, one hundred thirty-three million, four hundred forty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •