Base | Representation |
---|---|
bin | 11001001010101001… |
… | …11111100011001101 |
3 | 1021212121122010222200 |
4 | 30211110333203031 |
5 | 210132324141221 |
6 | 10112411032113 |
7 | 655550661015 |
oct | 144524774315 |
9 | 37777563880 |
10 | 13511162061 |
11 | 5803776041 |
12 | 2750a3b639 |
13 | 1374264567 |
14 | 9225c8c45 |
15 | 541272426 |
hex | 32553f8cd |
13511162061 has 12 divisors (see below), whose sum is σ = 19578879840. Its totient is φ = 8978476680.
The previous prime is 13511162057. The next prime is 13511162069. The reversal of 13511162061 is 16026111531.
13511162061 is a `hidden beast` number, since 1 + 35 + 1 + 1 + 1 + 620 + 6 + 1 = 666.
It is not a de Polignac number, because 13511162061 - 22 = 13511162057 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13511162069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2410771 + ... + 2416368.
It is an arithmetic number, because the mean of its divisors is an integer number (1631573320).
Almost surely, 213511162061 is an apocalyptic number.
It is an amenable number.
13511162061 is a deficient number, since it is larger than the sum of its proper divisors (6067717779).
13511162061 is a wasteful number, since it uses less digits than its factorization.
13511162061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4827456 (or 4827453 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
Adding to 13511162061 its reverse (16026111531), we get a palindrome (29537273592).
The spelling of 13511162061 in words is "thirteen billion, five hundred eleven million, one hundred sixty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •