Base | Representation |
---|---|
bin | 1010011011011011110001… |
… | …0000011000100010101001 |
3 | 1111121011211221200210120222 |
4 | 2212312330100120202221 |
5 | 3000331220041440312 |
6 | 40215334202055425 |
7 | 2262264504626633 |
oct | 246667420304251 |
9 | 44534757623528 |
10 | 11466426124457 |
11 | 372097a688827 |
12 | 135232aaaa575 |
13 | 652382945885 |
14 | 2b8d99841a53 |
15 | 14d404a62672 |
hex | a6dbc4188a9 |
11466426124457 has 8 divisors (see below), whose sum is σ = 11491776321480. Its totient is φ = 11441086998400.
The previous prime is 11466426124367. The next prime is 11466426124459. The reversal of 11466426124457 is 75442162466411.
It can be written as a sum of positive squares in 4 ways, for example, as 48594841 + 11466377529616 = 6971^2 + 3386204^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11466426124457 - 28 = 11466426124201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11466426124399 and 11466426124408.
It is not an unprimeable number, because it can be changed into a prime (11466426124459) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 692294 + ... + 4838607.
It is an arithmetic number, because the mean of its divisors is an integer number (1436472040185).
Almost surely, 211466426124457 is an apocalyptic number.
It is an amenable number.
11466426124457 is a deficient number, since it is larger than the sum of its proper divisors (25350197023).
11466426124457 is an equidigital number, since it uses as much as digits as its factorization.
11466426124457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5535483.
The product of its digits is 7741440, while the sum is 53.
The spelling of 11466426124457 in words is "eleven trillion, four hundred sixty-six billion, four hundred twenty-six million, one hundred twenty-four thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •