Base | Representation |
---|---|
bin | 101110111001011100101… |
… | …0100101011111111110101 |
3 | 211211012010011120110010001 |
4 | 1131302321110223333311 |
5 | 1321101001344331203 |
6 | 21413014403231301 |
7 | 1233450663213631 |
oct | 135627124537765 |
9 | 24735104513101 |
10 | 6445560152053 |
11 | 2065601741380 |
12 | 881239078531 |
13 | 379a76965599 |
14 | 183d76b93dc1 |
15 | b29e556a91d |
hex | 5dcb952bff5 |
6445560152053 has 8 divisors (see below), whose sum is σ = 7033173525216. Its totient is φ = 5858222338800.
The previous prime is 6445560152047. The next prime is 6445560152131. The reversal of 6445560152053 is 3502510655446.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6445560152053 is a prime.
It is a super-2 number, since 2×64455601520532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6445560151994 and 6445560152012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6445560152153) 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, 68841063 + ... + 68934628.
It is an arithmetic number, because the mean of its divisors is an integer number (879146690652).
Almost surely, 26445560152053 is an apocalyptic number.
It is an amenable number.
6445560152053 is a deficient number, since it is larger than the sum of its proper divisors (587613373163).
6445560152053 is a wasteful number, since it uses less digits than its factorization.
6445560152053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137779955.
The product of its (nonzero) digits is 2160000, while the sum is 46.
The spelling of 6445560152053 in words is "six trillion, four hundred forty-five billion, five hundred sixty million, one hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •