Base | Representation |
---|---|
bin | 101011010101001… |
… | …1100011011000101 |
3 | 10202022220011211022 |
4 | 1112222130123011 |
5 | 10434203421140 |
6 | 400135320525 |
7 | 51013341656 |
oct | 12652343305 |
9 | 3668804738 |
10 | 1453967045 |
11 | 6867a9a63 |
12 | 346b20145 |
13 | 1a22c573b |
14 | db15d52d |
15 | 879a50b5 |
hex | 56a9c6c5 |
1453967045 has 8 divisors (see below), whose sum is σ = 1760201496. Its totient is φ = 1152879616.
The previous prime is 1453967017. The next prime is 1453967083. The reversal of 1453967045 is 5407693541.
It can be written as a sum of positive squares in 4 ways, for example, as 14371681 + 1439595364 = 3791^2 + 37942^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1453967045 - 212 = 1453962949 is a prime.
It is a super-2 number, since 2×14539670452 = 4228040335892064050, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1453966987 and 1453967005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1286132 + ... + 1287261.
It is an arithmetic number, because the mean of its divisors is an integer number (220025187).
Almost surely, 21453967045 is an apocalyptic number.
It is an amenable number.
1453967045 is a deficient number, since it is larger than the sum of its proper divisors (306234451).
1453967045 is a wasteful number, since it uses less digits than its factorization.
1453967045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2573511.
The product of its (nonzero) digits is 453600, while the sum is 44.
The square root of 1453967045 is about 38130.9198027008. The cubic root of 1453967045 is about 1132.8824640146.
The spelling of 1453967045 in words is "one billion, four hundred fifty-three million, nine hundred sixty-seven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •