Base | Representation |
---|---|
bin | 100010001010101… |
… | …1010010101001001 |
3 | 2221220021101100101 |
4 | 1010111122111021 |
5 | 4321443313221 |
6 | 305432405401 |
7 | 40260531235 |
oct | 10425322511 |
9 | 2856241311 |
10 | 1146463561 |
11 | 539170051 |
12 | 27bb46861 |
13 | 15369b509 |
14 | ac3955c5 |
15 | 6a9b2d91 |
hex | 4455a549 |
1146463561 has 16 divisors (see below), whose sum is σ = 1225025424. Its totient is φ = 1069185024.
The previous prime is 1146463559. The next prime is 1146463627. The reversal of 1146463561 is 1653646411.
It can be written as a sum of positive squares in 8 ways, for example, as 114062400 + 1032401161 = 10680^2 + 32131^2 .
It is a cyclic number.
It is not a de Polignac number, because 1146463561 - 21 = 1146463559 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1146463561.
It is not an unprimeable number, because it can be changed into a prime (1146463541) 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 15 ways as a sum of consecutive naturals, for example, 1343611 + ... + 1344463.
It is an arithmetic number, because the mean of its divisors is an integer number (76564089).
Almost surely, 21146463561 is an apocalyptic number.
It is an amenable number.
1146463561 is a deficient number, since it is larger than the sum of its proper divisors (78561863).
1146463561 is a wasteful number, since it uses less digits than its factorization.
1146463561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1500.
The product of its digits is 51840, while the sum is 37.
The square root of 1146463561 is about 33859.4678192083. The cubic root of 1146463561 is about 1046.6145112534.
The spelling of 1146463561 in words is "one billion, one hundred forty-six million, four hundred sixty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •