Base | Representation |
---|---|
bin | 11110101001111011110… |
… | …00010001111100001101 |
3 | 10201200202122110200020222 |
4 | 33110331320101330031 |
5 | 114224132104314440 |
6 | 2123514240521125 |
7 | 136045612030154 |
oct | 17247570217415 |
9 | 3650678420228 |
10 | 1053305151245 |
11 | 376782330aa6 |
12 | 1501799201a5 |
13 | 78431a02459 |
14 | 38da1ad459b |
15 | 1c5eb37a2b5 |
hex | f53de11f0d |
1053305151245 has 4 divisors (see below), whose sum is σ = 1263966181500. Its totient is φ = 842644120992.
The previous prime is 1053305151233. The next prime is 1053305151251. The reversal of 1053305151245 is 5421515033501.
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 433651224484 + 619653926761 = 658522^2 + 787181^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053305151245 - 24 = 1053305151229 is a prime.
It is a super-2 number, since 2×10533051512452 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105330515120 + ... + 105330515129.
It is an arithmetic number, because the mean of its divisors is an integer number (315991545375).
Almost surely, 21053305151245 is an apocalyptic number.
It is an amenable number.
1053305151245 is a deficient number, since it is larger than the sum of its proper divisors (210661030255).
1053305151245 is an equidigital number, since it uses as much as digits as its factorization.
1053305151245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210661030254.
The product of its (nonzero) digits is 45000, while the sum is 35.
The spelling of 1053305151245 in words is "one trillion, fifty-three billion, three hundred five million, one hundred fifty-one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •