Base | Representation |
---|---|
bin | 100001101011110… |
… | …0011000110001101 |
3 | 2220202202110210000 |
4 | 1003113203012031 |
5 | 4303320342131 |
6 | 304053034513 |
7 | 40002636264 |
oct | 10327430615 |
9 | 2822673700 |
10 | 1130246541 |
11 | 52aaa3a56 |
12 | 276625a39 |
13 | 150210c48 |
14 | aa1735db |
15 | 6935cce6 |
hex | 435e318d |
1130246541 has 20 divisors (see below), whose sum is σ = 1698173532. Its totient is φ = 749132928.
The previous prime is 1130246527. The next prime is 1130246561. The reversal of 1130246541 is 1456420311.
It is a happy number.
1130246541 is a `hidden beast` number, since 1 + 1 + 3 + 0 + 2 + 4 + 654 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1102904100 + 27342441 = 33210^2 + 5229^2 .
It is not a de Polignac number, because 1130246541 - 221 = 1128149389 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130246561) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 26316 + ... + 54341.
Almost surely, 21130246541 is an apocalyptic number.
It is an amenable number.
1130246541 is a deficient number, since it is larger than the sum of its proper divisors (567926991).
1130246541 is an equidigital number, since it uses as much as digits as its factorization.
1130246541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80842 (or 80833 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 1130246541 is about 33619.1395041574. The cubic root of 1130246541 is about 1041.6561817341.
Adding to 1130246541 its reverse (1456420311), we get a palindrome (2586666852).
The spelling of 1130246541 in words is "one billion, one hundred thirty million, two hundred forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •