Base | Representation |
---|---|
bin | 11110101010001101101… |
… | …00101011101111100101 |
3 | 10201201011002211002222112 |
4 | 33111012310223233211 |
5 | 114224434013001201 |
6 | 2123541201010405 |
7 | 136052413324544 |
oct | 17250664535745 |
9 | 3651132732875 |
10 | 1053455203301 |
11 | 376849aa9366 |
12 | 150200023a05 |
13 | 78456b1bc57 |
14 | 38db79d415b |
15 | 1c60961a0bb |
hex | f546d2bbe5 |
1053455203301 has 4 divisors (see below), whose sum is σ = 1053621029772. Its totient is φ = 1053289376832.
The previous prime is 1053455203271. The next prime is 1053455203321. The reversal of 1053455203301 is 1033025543501.
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 494476176100 + 558979027201 = 703190^2 + 747649^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1053455203301 is a prime.
It is a super-2 number, since 2×10534552033012 (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 (1053455203321) 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, 82903706 + ... + 82916411.
It is an arithmetic number, because the mean of its divisors is an integer number (263405257443).
Almost surely, 21053455203301 is an apocalyptic number.
It is an amenable number.
1053455203301 is a deficient number, since it is larger than the sum of its proper divisors (165826471).
1053455203301 is an equidigital number, since it uses as much as digits as its factorization.
1053455203301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165826470.
The product of its (nonzero) digits is 27000, while the sum is 32.
The spelling of 1053455203301 in words is "one trillion, fifty-three billion, four hundred fifty-five million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •