Base | Representation |
---|---|
bin | 1010000010111110000001… |
… | …0111000000100110000001 |
3 | 1110002222222110001210112211 |
4 | 2200233200113000212001 |
5 | 2421434431002434040 |
6 | 35254304135222121 |
7 | 2220025163461450 |
oct | 240574027004601 |
9 | 43088873053484 |
10 | 11046125046145 |
11 | 35796a9686862 |
12 | 12a4990b17941 |
13 | 621850445077 |
14 | 2a28c73c2b97 |
15 | 142505c798ea |
hex | a0be05c0981 |
11046125046145 has 16 divisors (see below), whose sum is σ = 15202882435968. Its totient is φ = 7547530273920.
The previous prime is 11046125046133. The next prime is 11046125046157. The reversal of 11046125046145 is 54164052164011.
It is an interprime number because it is at equal distance from previous prime (11046125046133) and next prime (11046125046157).
It is not a de Polignac number, because 11046125046145 - 233 = 11037535111553 is a prime.
It is a super-3 number, since 3×110461250461453 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11046125046098 and 11046125046107.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 561562359 + ... + 561582028.
It is an arithmetic number, because the mean of its divisors is an integer number (950180152248).
Almost surely, 211046125046145 is an apocalyptic number.
It is an amenable number.
11046125046145 is a deficient number, since it is larger than the sum of its proper divisors (4156757389823).
11046125046145 is a wasteful number, since it uses less digits than its factorization.
11046125046145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1123144680.
The product of its (nonzero) digits is 115200, while the sum is 40.
The spelling of 11046125046145 in words is "eleven trillion, forty-six billion, one hundred twenty-five million, forty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •