Base | Representation |
---|---|
bin | 1010011110001111011110… |
… | …0110000101110111100100 |
3 | 1111202210100220010012011211 |
4 | 2213203313212011313210 |
5 | 3002124014033424030 |
6 | 40253433100441204 |
7 | 2265623110511416 |
oct | 247436746056744 |
9 | 44683326105154 |
10 | 11514666311140 |
11 | 373a384a45003 |
12 | 135b752549204 |
13 | 656a9cc26035 |
14 | 2bb45455a9b6 |
15 | 14e7c9b8b12a |
hex | a78f7985de4 |
11514666311140 has 48 divisors (see below), whose sum is σ = 25856696308464. Its totient is φ = 4292013056000.
The previous prime is 11514666311107. The next prime is 11514666311207. The reversal of 11514666311140 is 4111366641511.
It can be written as a sum of positive squares in 8 ways, for example, as 2203739136 + 11512462572004 = 46944^2 + 3393002^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11514666311093 and 11514666311102.
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, 167622421 + ... + 167691100.
It is an arithmetic number, because the mean of its divisors is an integer number (538681173093).
Almost surely, 211514666311140 is an apocalyptic number.
11514666311140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11514666311140 is an abundant number, since it is smaller than the sum of its proper divisors (14342029997324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11514666311140 is a wasteful number, since it uses less digits than its factorization.
11514666311140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335313648 (or 335313646 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 40.
The spelling of 11514666311140 in words is "eleven trillion, five hundred fourteen billion, six hundred sixty-six million, three hundred eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •