Base | Representation |
---|---|
bin | 1001100001010010010… |
… | …0000111101111010111 |
3 | 120122011100021101120220 |
4 | 2120110210013233113 |
5 | 10134424231123310 |
6 | 203045140525423 |
7 | 14550005053005 |
oct | 2302444075727 |
9 | 518140241526 |
10 | 163553770455 |
11 | 633a9926539 |
12 | 278459b0873 |
13 | 125665b188a |
14 | 7cb78aba75 |
15 | 43c396b670 |
hex | 2614907bd7 |
163553770455 has 16 divisors (see below), whose sum is σ = 262268863200. Its totient is φ = 87034400768.
The previous prime is 163553770343. The next prime is 163553770489. The reversal of 163553770455 is 554077355361.
163553770455 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 163553770455 - 212 = 163553766359 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 163553770398 and 163553770407.
It is a congruent number.
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, 12135342 + ... + 12148811.
It is an arithmetic number, because the mean of its divisors is an integer number (16391803950).
Almost surely, 2163553770455 is an apocalyptic number.
163553770455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
163553770455 is a deficient number, since it is larger than the sum of its proper divisors (98715092745).
163553770455 is a wasteful number, since it uses less digits than its factorization.
163553770455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24284610.
The product of its (nonzero) digits is 6615000, while the sum is 51.
The spelling of 163553770455 in words is "one hundred sixty-three billion, five hundred fifty-three million, seven hundred seventy thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •