Base | Representation |
---|---|
bin | 101000110010100101110… |
… | …1000100011101111101011 |
3 | 201211221120210201001100020 |
4 | 1101211023220203233223 |
5 | 1213323000004312101 |
6 | 15531241525011523 |
7 | 1116014615215500 |
oct | 121451350435753 |
9 | 21757523631306 |
10 | 5606201244651 |
11 | 18716384a3a37 |
12 | 766629553ba3 |
13 | 31887c6bc1b7 |
14 | 1554ad4634a7 |
15 | 9ac6bbca136 |
hex | 5194ba23beb |
5606201244651 has 48 divisors (see below), whose sum is σ = 9240061460256. Its totient is φ = 3004214621184.
The previous prime is 5606201244601. The next prime is 5606201244659. The reversal of 5606201244651 is 1564421026065.
It is not a de Polignac number, because 5606201244651 - 26 = 5606201244587 is a prime.
It is a super-2 number, since 2×56062012446512 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5606201244659) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 3357196 + ... + 4741641.
It is an arithmetic number, because the mean of its divisors is an integer number (192501280422).
Almost surely, 25606201244651 is an apocalyptic number.
5606201244651 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5606201244651 is a deficient number, since it is larger than the sum of its proper divisors (3633860215605).
5606201244651 is a wasteful number, since it uses less digits than its factorization.
5606201244651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8099148 (or 8099141 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 5606201244651 in words is "five trillion, six hundred six billion, two hundred one million, two hundred forty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •