Base | Representation |
---|---|
bin | 1001100010110010011… |
… | …0011001010111110110 |
3 | 120200012110001121011210 |
4 | 2120230212121113312 |
5 | 10141240444121100 |
6 | 203153143542250 |
7 | 14563002451050 |
oct | 2305446312766 |
9 | 520173047153 |
10 | 163957020150 |
11 | 63596510a50 |
12 | 27938a5a986 |
13 | 125cbcc0371 |
14 | 7d1527a8d0 |
15 | 43e9072c50 |
hex | 262c9995f6 |
163957020150 has 384 divisors, whose sum is σ = 552050380800. Its totient is φ = 31161715200.
The previous prime is 163957020091. The next prime is 163957020167. The reversal of 163957020150 is 51020759361.
It is a junction number, because it is equal to n+sod(n) for n = 163957020099 and 163957020108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 6351169 + ... + 6376931.
It is an arithmetic number, because the mean of its divisors is an integer number (1437631200).
Almost surely, 2163957020150 is an apocalyptic number.
163957020150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 163957020150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (276025190400).
163957020150 is an abundant number, since it is smaller than the sum of its proper divisors (388093360650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163957020150 is a wasteful number, since it uses less digits than its factorization.
163957020150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25844 (or 25839 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 39.
The spelling of 163957020150 in words is "one hundred sixty-three billion, nine hundred fifty-seven million, twenty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •