Base | Representation |
---|---|
bin | 11101011011111001110… |
… | …10111000000001001001 |
3 | 10120200122010020011010200 |
4 | 32231330322320001021 |
5 | 113032333224420040 |
6 | 2052345313202413 |
7 | 133033521461355 |
oct | 16557472700111 |
9 | 3520563204120 |
10 | 1011413123145 |
11 | 35aa35382277 |
12 | 144028260409 |
13 | 744b697aa49 |
14 | 36d4a136465 |
15 | 1b49870c630 |
hex | eb7ceb8049 |
1011413123145 has 24 divisors (see below), whose sum is σ = 1829338520256. Its totient is φ = 515967273888.
The previous prime is 1011413123137. The next prime is 1011413123213. The reversal of 1011413123145 is 5413213141101.
1011413123145 is a `hidden beast` number, since 1 + 0 + 11 + 413 + 1 + 231 + 4 + 5 = 666.
It is not a de Polignac number, because 1011413123145 - 23 = 1011413123137 is a prime.
It is a super-3 number, since 3×10114131231453 (a number of 37 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 488604339 + ... + 488606408.
It is an arithmetic number, because the mean of its divisors is an integer number (76222438344).
Almost surely, 21011413123145 is an apocalyptic number.
1011413123145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1011413123145 is a deficient number, since it is larger than the sum of its proper divisors (817925397111).
1011413123145 is a wasteful number, since it uses less digits than its factorization.
1011413123145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 977210781 (or 977210778 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 1011413123145 its reverse (5413213141101), we get a palindrome (6424626264246).
The spelling of 1011413123145 in words is "one trillion, eleven billion, four hundred thirteen million, one hundred twenty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •