Base | Representation |
---|---|
bin | 101011010110001… |
… | …0011010100011001 |
3 | 10202100210220212012 |
4 | 1112230103110121 |
5 | 10434320012131 |
6 | 400153555305 |
7 | 51020440535 |
oct | 12654232431 |
9 | 3670726765 |
10 | 1454454041 |
11 | 687001937 |
12 | 347115b35 |
13 | 1a24362c1 |
14 | db248bc5 |
15 | 87a4e52b |
hex | 56b13519 |
1454454041 has 2 divisors, whose sum is σ = 1454454042. Its totient is φ = 1454454040.
The previous prime is 1454453993. The next prime is 1454454073. The reversal of 1454454041 is 1404544541.
It is an a-pointer prime, because the next prime (1454454073) can be obtained adding 1454454041 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1331155225 + 123298816 = 36485^2 + 11104^2 .
It is a cyclic number.
It is not a de Polignac number, because 1454454041 - 26 = 1454453977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1454453989 and 1454454007.
It is not a weakly prime, because it can be changed into another prime (1454456041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 727227020 + 727227021.
It is an arithmetic number, because the mean of its divisors is an integer number (727227021).
Almost surely, 21454454041 is an apocalyptic number.
It is an amenable number.
1454454041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1454454041 is an equidigital number, since it uses as much as digits as its factorization.
1454454041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25600, while the sum is 32.
The square root of 1454454041 is about 38137.3051093021. The cubic root of 1454454041 is about 1133.0089335576.
Adding to 1454454041 its reverse (1404544541), we get a palindrome (2858998582).
The spelling of 1454454041 in words is "one billion, four hundred fifty-four million, four hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •