Base | Representation |
---|---|
bin | 100010001000001… |
… | …0000011110100001 |
3 | 2221210201202000101 |
4 | 1010100100132201 |
5 | 4321122044411 |
6 | 305343422401 |
7 | 40243203232 |
oct | 10420203641 |
9 | 2853652011 |
10 | 1145112481 |
11 | 538427a57 |
12 | 27b5b4a01 |
13 | 153317566 |
14 | ac123089 |
15 | 6a7e78c1 |
hex | 444107a1 |
1145112481 has 2 divisors, whose sum is σ = 1145112482. Its totient is φ = 1145112480.
The previous prime is 1145112461. The next prime is 1145112511. The reversal of 1145112481 is 1842115411.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1131716881 + 13395600 = 33641^2 + 3660^2 .
It is a cyclic number.
It is not a de Polignac number, because 1145112481 - 211 = 1145110433 is a prime.
It is a super-2 number, since 2×11451124812 = 2622565188283950722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1145112461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572556240 + 572556241.
It is an arithmetic number, because the mean of its divisors is an integer number (572556241).
Almost surely, 21145112481 is an apocalyptic number.
It is an amenable number.
1145112481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145112481 is an equidigital number, since it uses as much as digits as its factorization.
1145112481 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1280, while the sum is 28.
The square root of 1145112481 is about 33839.5106495351. The cubic root of 1145112481 is about 1046.2032128849.
Adding to 1145112481 its reverse (1842115411), we get a palindrome (2987227892).
It can be divided in two parts, 11451 and 12481, that added together give a palindrome (23932).
The spelling of 1145112481 in words is "one billion, one hundred forty-five million, one hundred twelve thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •