Base | Representation |
---|---|
bin | 101011010000011… |
… | …0010000010001001 |
3 | 10202011010111022022 |
4 | 1112200302002021 |
5 | 10433031342441 |
6 | 400005134225 |
7 | 50652662234 |
oct | 12640620211 |
9 | 3664114268 |
10 | 1451434121 |
11 | 685329a35 |
12 | 3460ba375 |
13 | 1a1919877 |
14 | daaa041b |
15 | 8765484b |
hex | 56832089 |
1451434121 has 2 divisors, whose sum is σ = 1451434122. Its totient is φ = 1451434120.
The previous prime is 1451434099. The next prime is 1451434129. The reversal of 1451434121 is 1214341541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1428008521 + 23425600 = 37789^2 + 4840^2 .
It is a cyclic number.
It is not a de Polignac number, because 1451434121 - 210 = 1451433097 is a prime.
It is a super-2 number, since 2×14514341212 = 4213322015206085282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1451434129) 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, 725717060 + 725717061.
It is an arithmetic number, because the mean of its divisors is an integer number (725717061).
Almost surely, 21451434121 is an apocalyptic number.
It is an amenable number.
1451434121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1451434121 is an equidigital number, since it uses as much as digits as its factorization.
1451434121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1920, while the sum is 26.
The square root of 1451434121 is about 38097.6918067224. The cubic root of 1451434121 is about 1132.2242250934.
Adding to 1451434121 its reverse (1214341541), we get a palindrome (2665775662).
The spelling of 1451434121 in words is "one billion, four hundred fifty-one million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •