Base | Representation |
---|---|
bin | 101011001111101… |
… | …1111110011000001 |
3 | 10202010111101020202 |
4 | 1112133133303001 |
5 | 10432440103111 |
6 | 355554014545 |
7 | 50650060214 |
oct | 12637376301 |
9 | 3663441222 |
10 | 1451097281 |
11 | 685119957 |
12 | 345b77455 |
13 | 1a182c45a |
14 | daa1377b |
15 | 875d9b3b |
hex | 567dfcc1 |
1451097281 has 2 divisors, whose sum is σ = 1451097282. Its totient is φ = 1451097280.
The previous prime is 1451097257. The next prime is 1451097283. The reversal of 1451097281 is 1827901541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 900960256 + 550137025 = 30016^2 + 23455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1451097281 is a prime.
It is a super-2 number, since 2×14510972812 = 4211366637851185922, which contains 22 as substring.
Together with 1451097283, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1451097283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 725548640 + 725548641.
It is an arithmetic number, because the mean of its divisors is an integer number (725548641).
Almost surely, 21451097281 is an apocalyptic number.
It is an amenable number.
1451097281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1451097281 is an equidigital number, since it uses as much as digits as its factorization.
1451097281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 38.
The square root of 1451097281 is about 38093.2708099475. The cubic root of 1451097281 is about 1132.1366317472.
The spelling of 1451097281 in words is "one billion, four hundred fifty-one million, ninety-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •