Base | Representation |
---|---|
bin | 1010000001110000110100… |
… | …1001000100011010101111 |
3 | 1110001000111012010002202222 |
4 | 2200130031021010122233 |
5 | 2421120010242430111 |
6 | 35240555522305555 |
7 | 2215362504501230 |
oct | 240341511043257 |
9 | 43030435102688 |
10 | 11025401530031 |
11 | 3570934806439 |
12 | 12a09687b82bb |
13 | 61c8c9bb63b5 |
14 | 2a18bcda1087 |
15 | 141be17437db |
hex | a070d2446af |
11025401530031 has 16 divisors (see below), whose sum is σ = 12608154600960. Its totient is φ = 9444574188000.
The previous prime is 11025401530021. The next prime is 11025401530093. The reversal of 11025401530031 is 13003510452011.
It is not a de Polignac number, because 11025401530031 - 242 = 6627355018927 is a prime.
It is a super-2 number, since 2×110254015300312 (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 (11025401530021) 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 15 ways as a sum of consecutive naturals, for example, 76759781 + ... + 76903281.
It is an arithmetic number, because the mean of its divisors is an integer number (788009662560).
Almost surely, 211025401530031 is an apocalyptic number.
11025401530031 is a deficient number, since it is larger than the sum of its proper divisors (1582753070929).
11025401530031 is a wasteful number, since it uses less digits than its factorization.
11025401530031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150134.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 11025401530031 its reverse (13003510452011), we get a palindrome (24028911982042).
The spelling of 11025401530031 in words is "eleven trillion, twenty-five billion, four hundred one million, five hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •