Base | Representation |
---|---|
bin | 10101011100100101… |
… | …00000111000000001 |
3 | 1002201102122222211001 |
4 | 22232102200320001 |
5 | 142040042222200 |
6 | 5142305252001 |
7 | 555220404262 |
oct | 125622407001 |
9 | 32642588731 |
10 | 11514023425 |
11 | 4979403243 |
12 | 2294034001 |
13 | 111657c718 |
14 | 7b3276969 |
15 | 475c7776a |
hex | 2ae4a0e01 |
11514023425 has 24 divisors (see below), whose sum is σ = 14644654200. Its totient is φ = 8976614400.
The previous prime is 11514023419. The next prime is 11514023429. The reversal of 11514023425 is 52432041511.
It can be written as a sum of positive squares in 12 ways, for example, as 7890946561 + 3623076864 = 88831^2 + 60192^2 .
It is not a de Polignac number, because 11514023425 - 223 = 11505634817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11514023393 and 11514023402.
It is not an unprimeable number, because it can be changed into a prime (11514023429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 168265 + ... + 226585.
It is an arithmetic number, because the mean of its divisors is an integer number (610193925).
Almost surely, 211514023425 is an apocalyptic number.
It is an amenable number.
11514023425 is a deficient number, since it is larger than the sum of its proper divisors (3130630775).
11514023425 is a wasteful number, since it uses less digits than its factorization.
11514023425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58533 (or 58528 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 11514023425 its reverse (52432041511), we get a palindrome (63946064936).
The spelling of 11514023425 in words is "eleven billion, five hundred fourteen million, twenty-three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •