Base | Representation |
---|---|
bin | 10101001001110101001… |
… | …011111010110111111101 |
3 | 12010222011102011111212121 |
4 | 111021311023322313331 |
5 | 142304101220130203 |
6 | 3031445434002541 |
7 | 210011113445512 |
oct | 25116513726775 |
9 | 5128142144777 |
10 | 1453665005053 |
11 | 51054aaa8938 |
12 | 1b5891576451 |
13 | a7106a66b31 |
14 | 505019ab309 |
15 | 27c2e6570bd |
hex | 152752fadfd |
1453665005053 has 4 divisors (see below), whose sum is σ = 1453721085628. Its totient is φ = 1453608924480.
The previous prime is 1453665005003. The next prime is 1453665005059. The reversal of 1453665005053 is 3505005663541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 239025165604 + 1214639839449 = 488902^2 + 1102107^2 .
It is a cyclic number.
It is not a de Polignac number, because 1453665005053 - 29 = 1453665004541 is a prime.
It is a super-2 number, since 2×14536650050532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1453665005059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28001388 + ... + 28053253.
It is an arithmetic number, because the mean of its divisors is an integer number (363430271407).
Almost surely, 21453665005053 is an apocalyptic number.
It is an amenable number.
1453665005053 is a deficient number, since it is larger than the sum of its proper divisors (56080575).
1453665005053 is an equidigital number, since it uses as much as digits as its factorization.
1453665005053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56080574.
The product of its (nonzero) digits is 810000, while the sum is 43.
The spelling of 1453665005053 in words is "one trillion, four hundred fifty-three billion, six hundred sixty-five million, five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •