Base | Representation |
---|---|
bin | 1010000000111000111111… |
… | …0101010101000010000011 |
3 | 1102222120210200222222222221 |
4 | 2200032033311111002003 |
5 | 2420343312030120230 |
6 | 35230040422111511 |
7 | 2214322221242662 |
oct | 240161765250203 |
9 | 42876720888887 |
10 | 11010414301315 |
11 | 3565543917700 |
12 | 1299a8557b597 |
13 | 61b37bbbc420 |
14 | 2a0c9a742dd9 |
15 | 141615b0327a |
hex | a038fd55083 |
11010414301315 has 96 divisors (see below), whose sum is σ = 15926803200000. Its totient is φ = 7256920070400.
The previous prime is 11010414301303. The next prime is 11010414301361. The reversal of 11010414301315 is 51310341401011.
It is not a de Polignac number, because 11010414301315 - 221 = 11010412204163 is a prime.
It is a super-2 number, since 2×110104143013152 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11010414301315.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 133419936 + ... + 133502434.
It is an arithmetic number, because the mean of its divisors is an integer number (165904200000).
Almost surely, 211010414301315 is an apocalyptic number.
11010414301315 is a deficient number, since it is larger than the sum of its proper divisors (4916388898685).
11010414301315 is a wasteful number, since it uses less digits than its factorization.
11010414301315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82849 (or 82838 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 11010414301315 its reverse (51310341401011), we get a palindrome (62320755702326).
The spelling of 11010414301315 in words is "eleven trillion, ten billion, four hundred fourteen million, three hundred one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •