Base | Representation |
---|---|
bin | 10101011101011010… |
… | …01011110110111111 |
3 | 1002201220211012202211 |
4 | 22232231023312333 |
5 | 142043334441411 |
6 | 5143115201251 |
7 | 555334004455 |
oct | 125655136677 |
9 | 32656735684 |
10 | 11521015231 |
11 | 49823492a0 |
12 | 2296446227 |
13 | 1117b59c9b |
14 | 7b41769d5 |
15 | 4766a9221 |
hex | 2aeb4bdbf |
11521015231 has 16 divisors (see below), whose sum is σ = 12716621568. Its totient is φ = 10350659200.
The previous prime is 11521015229. The next prime is 11521015273. The reversal of 11521015231 is 13251012511.
It is a cyclic number.
It is not a de Polignac number, because 11521015231 - 21 = 11521015229 is a prime.
It is a super-2 number, since 2×115210152312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11521015531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 417966 + ... + 444676.
It is an arithmetic number, because the mean of its divisors is an integer number (794788848).
Almost surely, 211521015231 is an apocalyptic number.
11521015231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11521015231 is a deficient number, since it is larger than the sum of its proper divisors (1195606337).
11521015231 is a wasteful number, since it uses less digits than its factorization.
11521015231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27182.
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 11521015231 its reverse (13251012511), we get a palindrome (24772027742).
The spelling of 11521015231 in words is "eleven billion, five hundred twenty-one million, fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •