Base | Representation |
---|---|
bin | 1010001110011000111000… |
… | …0010011100110001001111 |
3 | 1110210202101002020000210110 |
4 | 2203212032002130301033 |
5 | 2433143223434423211 |
6 | 35524351431411103 |
7 | 2240141660602551 |
oct | 243461602346117 |
9 | 43722332200713 |
10 | 11242312420431 |
11 | 3644924302914 |
12 | 1316a03823a93 |
13 | 6371b78c90a1 |
14 | 2ac1b8da74d1 |
15 | 14768963bea6 |
hex | a398e09cc4f |
11242312420431 has 8 divisors (see below), whose sum is σ = 14989814886784. Its totient is φ = 7494842450520.
The previous prime is 11242312420429. The next prime is 11242312420481. The reversal of 11242312420431 is 13402421324211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11242312420431 - 21 = 11242312420429 is a prime.
It is a super-2 number, since 2×112423124204312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11242312420481) 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, 7305085 + ... + 8709126.
It is an arithmetic number, because the mean of its divisors is an integer number (1873726860848).
Almost surely, 211242312420431 is an apocalyptic number.
11242312420431 is a deficient number, since it is larger than the sum of its proper divisors (3747502466353).
11242312420431 is a wasteful number, since it uses less digits than its factorization.
11242312420431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16248221.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 11242312420431 its reverse (13402421324211), we get a palindrome (24644733744642).
The spelling of 11242312420431 in words is "eleven trillion, two hundred forty-two billion, three hundred twelve million, four hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •