Base | Representation |
---|---|
bin | 101011010101010… |
… | …1100000100001001 |
3 | 10202100000102201012 |
4 | 1112222230010021 |
5 | 10434212443423 |
6 | 400140533305 |
7 | 51014026523 |
oct | 12652540411 |
9 | 3670012635 |
10 | 1454031113 |
11 | 686843107 |
12 | 346b51235 |
13 | 1a2318952 |
14 | db178a13 |
15 | 879b9078 |
hex | 56aac109 |
1454031113 has 2 divisors, whose sum is σ = 1454031114. Its totient is φ = 1454031112.
The previous prime is 1454031083. The next prime is 1454031167. The reversal of 1454031113 is 3111304541.
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., 1386594169 + 67436944 = 37237^2 + 8212^2 .
It is a cyclic number.
It is not a de Polignac number, because 1454031113 - 218 = 1453768969 is a prime.
It is a super-2 number, since 2×14540311132 = 4228412955144037538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1454036113) 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, 727015556 + 727015557.
It is an arithmetic number, because the mean of its divisors is an integer number (727015557).
Almost surely, 21454031113 is an apocalyptic number.
It is an amenable number.
1454031113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1454031113 is an equidigital number, since it uses as much as digits as its factorization.
1454031113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1454031113 is about 38131.7598990658. The cubic root of 1454031113 is about 1132.8991036507.
Adding to 1454031113 its reverse (3111304541), we get a palindrome (4565335654).
The spelling of 1454031113 in words is "one billion, four hundred fifty-four million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •