Base | Representation |
---|---|
bin | 1001100001101001001… |
… | …1011011000010011111 |
3 | 120122102001110020000012 |
4 | 2120122103123002133 |
5 | 10140123403300401 |
6 | 203102500353435 |
7 | 14552254345625 |
oct | 2303223330237 |
9 | 518361406005 |
10 | 163650056351 |
11 | 63449210561 |
12 | 278720a587b |
13 | 12580524992 |
14 | 7cc65b3515 |
15 | 43cc13a8bb |
hex | 261a4db09f |
163650056351 has 16 divisors (see below), whose sum is σ = 175098055104. Its totient is φ = 152405090304.
The previous prime is 163650056347. The next prime is 163650056363. The reversal of 163650056351 is 153650056361.
It is a happy number.
163650056351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 163650056351 - 22 = 163650056347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 163650056299 and 163650056308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163650056651) by changing a digit.
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, 15863171 + ... + 15873483.
It is an arithmetic number, because the mean of its divisors is an integer number (10943628444).
Almost surely, 2163650056351 is an apocalyptic number.
163650056351 is a deficient number, since it is larger than the sum of its proper divisors (11447998753).
163650056351 is a wasteful number, since it uses less digits than its factorization.
163650056351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20050.
The product of its (nonzero) digits is 243000, while the sum is 41.
The spelling of 163650056351 in words is "one hundred sixty-three billion, six hundred fifty million, fifty-six thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •