Base | Representation |
---|---|
bin | 100001101011010… |
… | …1100000110100001 |
3 | 2220202100000210001 |
4 | 1003112230012201 |
5 | 4303241140111 |
6 | 304044140001 |
7 | 40001010454 |
oct | 10326540641 |
9 | 2822300701 |
10 | 1130021281 |
11 | 52a95a794 |
12 | 276537601 |
13 | 15016255c |
14 | aa11549b |
15 | 693161c1 |
hex | 435ac1a1 |
1130021281 has 2 divisors, whose sum is σ = 1130021282. Its totient is φ = 1130021280.
The previous prime is 1130021273. The next prime is 1130021311. The reversal of 1130021281 is 1821200311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1066675600 + 63345681 = 32660^2 + 7959^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130021281 - 23 = 1130021273 is a prime.
It is a super-2 number, since 2×11300212812 = 2553896191025761922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1130021681) 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 as a sum of consecutive naturals, namely, 565010640 + 565010641.
It is an arithmetic number, because the mean of its divisors is an integer number (565010641).
Almost surely, 21130021281 is an apocalyptic number.
It is an amenable number.
1130021281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130021281 is an equidigital number, since it uses as much as digits as its factorization.
1130021281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
The square root of 1130021281 is about 33615.7891622374. The cubic root of 1130021281 is about 1041.5869758712.
Adding to 1130021281 its reverse (1821200311), we get a palindrome (2951221592).
The spelling of 1130021281 in words is "one billion, one hundred thirty million, twenty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •