Base | Representation |
---|---|
bin | 1010000000011011001110… |
… | …1010101000111010001011 |
3 | 1102221211011221202002121122 |
4 | 2200012303222220322023 |
5 | 2420230431414404311 |
6 | 35222240003225455 |
7 | 2213620235030204 |
oct | 240066352507213 |
9 | 42854157662548 |
10 | 11002425544331 |
11 | 3562114429301 |
12 | 129841607828b |
13 | 61a6a7ab48a0 |
14 | 2a073d7645ab |
15 | 1412e95c90db |
hex | a01b3aa8e8b |
11002425544331 has 32 divisors (see below), whose sum is σ = 12656135278080. Its totient is φ = 9479977516800.
The previous prime is 11002425544301. The next prime is 11002425544339. The reversal of 11002425544331 is 13344552420011.
It is a cyclic number.
It is not a de Polignac number, because 11002425544331 - 234 = 10985245675147 is a prime.
It is a super-2 number, since 2×110024255443312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11002425544291 and 11002425544300.
It is not an unprimeable number, because it can be changed into a prime (11002425544339) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27350951 + ... + 27750303.
It is an arithmetic number, because the mean of its divisors is an integer number (395504227440).
Almost surely, 211002425544331 is an apocalyptic number.
11002425544331 is a deficient number, since it is larger than the sum of its proper divisors (1653709733749).
11002425544331 is a wasteful number, since it uses less digits than its factorization.
11002425544331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401027.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 11002425544331 its reverse (13344552420011), we get a palindrome (24346977964342).
The spelling of 11002425544331 in words is "eleven trillion, two billion, four hundred twenty-five million, five hundred forty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •