Base | Representation |
---|---|
bin | 1010011110000110… |
… | …00100100111100001 |
3 | 112111202020011022200 |
4 | 11033003010213201 |
5 | 43003010011310 |
6 | 2325441123413 |
7 | 256204115421 |
oct | 51703044741 |
9 | 15452204280 |
10 | 5621172705 |
11 | 2425007285 |
12 | 110a629569 |
13 | 6b775b5c5 |
14 | 3b479a481 |
15 | 22d7579c0 |
hex | 14f0c49e1 |
5621172705 has 24 divisors (see below), whose sum is σ = 10256176320. Its totient is φ = 2840171040.
The previous prime is 5621172703. The next prime is 5621172709. The reversal of 5621172705 is 5072711265.
5621172705 is a `hidden beast` number, since 5 + 621 + 1 + 7 + 27 + 0 + 5 = 666.
5621172705 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5621172705 - 21 = 5621172703 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5621172705.
It is not an unprimeable number, because it can be changed into a prime (5621172703) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3286381 + ... + 3288090.
It is an arithmetic number, because the mean of its divisors is an integer number (427340680).
Almost surely, 25621172705 is an apocalyptic number.
It is an amenable number.
5621172705 is a deficient number, since it is larger than the sum of its proper divisors (4635003615).
5621172705 is a wasteful number, since it uses less digits than its factorization.
5621172705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6574501 (or 6574498 counting only the distinct ones).
The product of its (nonzero) digits is 29400, while the sum is 36.
The square root of 5621172705 is about 74974.4803583193. The cubic root of 5621172705 is about 1778.0432042849.
The spelling of 5621172705 in words is "five billion, six hundred twenty-one million, one hundred seventy-two thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •