Base | Representation |
---|---|
bin | 1010000001011101101000… |
… | …1110101111101001110011 |
3 | 1110000112012100010211110102 |
4 | 2200113122032233221303 |
5 | 2421023434104200111 |
6 | 35234344543023015 |
7 | 2215121061640655 |
oct | 240273216575163 |
9 | 43015170124412 |
10 | 11020252412531 |
11 | 356973220a22a |
12 | 129b97029aa6b |
13 | 61c2891a74cb |
14 | 2a15511a46d5 |
15 | 1419de68413b |
hex | a05da3afa73 |
11020252412531 has 16 divisors (see below), whose sum is σ = 11063326978080. Its totient is φ = 10977274429440.
The previous prime is 11020252412479. The next prime is 11020252412537. The reversal of 11020252412531 is 13521425202011.
It is a cyclic number.
It is not a de Polignac number, because 11020252412531 - 234 = 11003072543347 is a prime.
It is a super-2 number, since 2×110202524125312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020252412494 and 11020252412503.
It is not an unprimeable number, because it can be changed into a prime (11020252412537) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 935737715 + ... + 935749491.
It is an arithmetic number, because the mean of its divisors is an integer number (691457936130).
Almost surely, 211020252412531 is an apocalyptic number.
11020252412531 is a deficient number, since it is larger than the sum of its proper divisors (43074565549).
11020252412531 is a wasteful number, since it uses less digits than its factorization.
11020252412531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15574.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 11020252412531 its reverse (13521425202011), we get a palindrome (24541677614542).
The spelling of 11020252412531 in words is "eleven trillion, twenty billion, two hundred fifty-two million, four hundred twelve thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •