Base | Representation |
---|---|
bin | 101011010011100… |
… | …0001101011000001 |
3 | 10202021012122201222 |
4 | 1112213001223001 |
5 | 10433441233131 |
6 | 400104204425 |
7 | 51002620502 |
oct | 12647015301 |
9 | 3667178658 |
10 | 1453071041 |
11 | 686247864 |
12 | 346769715 |
13 | 1a2070966 |
14 | dada8ba9 |
15 | 8787987b |
hex | 569c1ac1 |
1453071041 has 2 divisors, whose sum is σ = 1453071042. Its totient is φ = 1453071040.
The previous prime is 1453071001. The next prime is 1453071047. The reversal of 1453071041 is 1401703541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1423477441 + 29593600 = 37729^2 + 5440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1453071041 is a prime.
It is a super-2 number, since 2×14530710412 = 4222830900385647362, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1453071041.
It is not a weakly prime, because it can be changed into another prime (1453071047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 726535520 + 726535521.
It is an arithmetic number, because the mean of its divisors is an integer number (726535521).
Almost surely, 21453071041 is an apocalyptic number.
It is an amenable number.
1453071041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1453071041 is an equidigital number, since it uses as much as digits as its factorization.
1453071041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 1453071041 is about 38119.1689442464. The cubic root of 1453071041 is about 1132.6497040849.
Adding to 1453071041 its reverse (1401703541), we get a palindrome (2854774582).
The spelling of 1453071041 in words is "one billion, four hundred fifty-three million, seventy-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •