Base | Representation |
---|---|
bin | 1001100100111000101… |
… | …0111011110100010001 |
3 | 120201122200212110112122 |
4 | 2121032022323310101 |
5 | 10143414140342140 |
6 | 203325103504025 |
7 | 14612652010364 |
oct | 2311612736421 |
9 | 521580773478 |
10 | 164520246545 |
11 | 63855432306 |
12 | 27a755b8015 |
13 | 1268b8b1b15 |
14 | 7d69db00db |
15 | 442d729ab5 |
hex | 264e2bbd11 |
164520246545 has 16 divisors (see below), whose sum is σ = 200787837120. Its totient is φ = 129374222784.
The previous prime is 164520246533. The next prime is 164520246557. The reversal of 164520246545 is 545642025461.
164520246545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (164520246533) and next prime (164520246557).
It is a cyclic number.
It is not a de Polignac number, because 164520246545 - 224 = 164503469329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 164520246496 and 164520246505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5653322 + ... + 5682348.
It is an arithmetic number, because the mean of its divisors is an integer number (12549239820).
Almost surely, 2164520246545 is an apocalyptic number.
It is an amenable number.
164520246545 is a deficient number, since it is larger than the sum of its proper divisors (36267590575).
164520246545 is a wasteful number, since it uses less digits than its factorization.
164520246545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48304.
The product of its (nonzero) digits is 1152000, while the sum is 44.
The spelling of 164520246545 in words is "one hundred sixty-four billion, five hundred twenty million, two hundred forty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •