Base | Representation |
---|---|
bin | 100010001000101… |
… | …0010011001010001 |
3 | 2221211020110101101 |
4 | 1010101102121101 |
5 | 4321204214411 |
6 | 305353304401 |
7 | 40245406345 |
oct | 10421223121 |
9 | 2854213341 |
10 | 1145382481 |
11 | 5385a18a1 |
12 | 27b705101 |
13 | 1533b0419 |
14 | ac193625 |
15 | 6a84c8c1 |
hex | 44452651 |
1145382481 has 2 divisors, whose sum is σ = 1145382482. Its totient is φ = 1145382480.
The previous prime is 1145382467. The next prime is 1145382493. The reversal of 1145382481 is 1842835411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1056250000 + 89132481 = 32500^2 + 9441^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145382481 - 221 = 1143285329 is a prime.
It is a super-2 number, since 2×11453824812 = 2623802055563430722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1145382481.
It is not a weakly prime, because it can be changed into another prime (1145385481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572691240 + 572691241.
It is an arithmetic number, because the mean of its divisors is an integer number (572691241).
Almost surely, 21145382481 is an apocalyptic number.
It is an amenable number.
1145382481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145382481 is an equidigital number, since it uses as much as digits as its factorization.
1145382481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30720, while the sum is 37.
The square root of 1145382481 is about 33843.4998337938. The cubic root of 1145382481 is about 1046.2854326593.
The spelling of 1145382481 in words is "one billion, one hundred forty-five million, three hundred eighty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •