Base | Representation |
---|---|
bin | 101011010100001… |
… | …1111011011000001 |
3 | 10202021221011111012 |
4 | 1112220133123001 |
5 | 10434041030131 |
6 | 400120330305 |
7 | 51006110153 |
oct | 12650373301 |
9 | 3667834435 |
10 | 1453455041 |
11 | 68648a315 |
12 | 346913995 |
13 | 1a217668c |
14 | db068ad3 |
15 | 8790352b |
hex | 56a1f6c1 |
1453455041 has 2 divisors, whose sum is σ = 1453455042. Its totient is φ = 1453455040.
The previous prime is 1453455037. The next prime is 1453455049. The reversal of 1453455041 is 1405543541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1097000641 + 356454400 = 33121^2 + 18880^2 .
It is a cyclic number.
It is not a de Polignac number, because 1453455041 - 22 = 1453455037 is a prime.
It is a super-2 number, since 2×14534550412 = 4225063112416623362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1453454989 and 1453455007.
It is not a weakly prime, because it can be changed into another prime (1453455049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 726727520 + 726727521.
It is an arithmetic number, because the mean of its divisors is an integer number (726727521).
Almost surely, 21453455041 is an apocalyptic number.
It is an amenable number.
1453455041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1453455041 is an equidigital number, since it uses as much as digits as its factorization.
1453455041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24000, while the sum is 32.
The square root of 1453455041 is about 38124.2054474582. The cubic root of 1453455041 is about 1132.7494696083.
Adding to 1453455041 its reverse (1405543541), we get a palindrome (2858998582).
The spelling of 1453455041 in words is "one billion, four hundred fifty-three million, four hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.003 sec. • engine limits •