Base | Representation |
---|---|
bin | 100110100110111010011… |
… | …0111110110111100001001 |
3 | 200210021100100212212211212 |
4 | 1031031310313312330021 |
5 | 1143414142311114234 |
6 | 15141353330302505 |
7 | 1055235464541545 |
oct | 115156467667411 |
9 | 20707310785755 |
10 | 5306245410569 |
11 | 17664032231a4 |
12 | 718476a27a35 |
13 | 2c64b8a8538c |
14 | 144b7613aa25 |
15 | 930633425ce |
hex | 4d374df6f09 |
5306245410569 has 8 divisors (see below), whose sum is σ = 5416699590720. Its totient is φ = 5196475157776.
The previous prime is 5306245410553. The next prime is 5306245410601. The reversal of 5306245410569 is 9650145426035.
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 5306245410569 - 24 = 5306245410553 is a prime.
It is a super-2 number, since 2×53062454105692 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5306245413569) 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, 170966162 + ... + 170997195.
It is an arithmetic number, because the mean of its divisors is an integer number (677087448840).
Almost surely, 25306245410569 is an apocalyptic number.
5306245410569 is a gapful number since it is divisible by the number (59) formed by its first and last digit.
It is an amenable number.
5306245410569 is a deficient number, since it is larger than the sum of its proper divisors (110454180151).
5306245410569 is a wasteful number, since it uses less digits than its factorization.
5306245410569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341963679.
The product of its (nonzero) digits is 3888000, while the sum is 50.
The spelling of 5306245410569 in words is "five trillion, three hundred six billion, two hundred forty-five million, four hundred ten thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •