Base | Representation |
---|---|
bin | 11110101001110101011… |
… | …01110110001010101101 |
3 | 10201200121221121121020011 |
4 | 33110322231312022231 |
5 | 114224030013200042 |
6 | 2123505103253221 |
7 | 136044366000262 |
oct | 17247255661255 |
9 | 3650557547204 |
10 | 1053252084397 |
11 | 3767553860a7 |
12 | 150163baa211 |
13 | 78423a12156 |
14 | 38d98a3d269 |
15 | 1c5e6896a17 |
hex | f53ab762ad |
1053252084397 has 8 divisors (see below), whose sum is σ = 1089589587840. Its totient is φ = 1016915812080.
The previous prime is 1053252084377. The next prime is 1053252084407. The reversal of 1053252084397 is 7934802523501.
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 1053252084397 - 211 = 1053252082349 is a prime.
It is a super-2 number, since 2×10532520843972 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1053252084397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053252084347) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1642272 + ... + 2191702.
It is an arithmetic number, because the mean of its divisors is an integer number (136198698480).
Almost surely, 21053252084397 is an apocalyptic number.
It is an amenable number.
1053252084397 is a deficient number, since it is larger than the sum of its proper divisors (36337503443).
1053252084397 is an equidigital number, since it uses as much as digits as its factorization.
1053252084397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 615563.
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 1053252084397 in words is "one trillion, fifty-three billion, two hundred fifty-two million, eighty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •