Base | Representation |
---|---|
bin | 1001100010110101001… |
… | …1001001110000000000 |
3 | 120200020021010200010110 |
4 | 2120231103021300000 |
5 | 10141302000041030 |
6 | 203154243231320 |
7 | 14563204254420 |
oct | 2305523116000 |
9 | 520207120113 |
10 | 163968752640 |
11 | 635a20a4820 |
12 | 27940978540 |
13 | 1260156a674 |
14 | 7d16a52480 |
15 | 43ea0de1b0 |
hex | 262d4c9c00 |
163968752640 has 352 divisors, whose sum is σ = 653856735744. Its totient is φ = 34071183360.
The previous prime is 163968752639. The next prime is 163968752663. The reversal of 163968752640 is 46257869361.
It is a tau number, because it is divible by the number of its divisors (352).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1113402 + ... + 1252038.
It is a 1-persistent number, because it is pandigital, but 2⋅163968752640 = 327937505280 is not.
Almost surely, 2163968752640 is an apocalyptic number.
163968752640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 163968752640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (326928367872).
163968752640 is an abundant number, since it is smaller than the sum of its proper divisors (489887983104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163968752640 is a wasteful number, since it uses less digits than its factorization.
163968752640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138683 (or 138665 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 57.
The spelling of 163968752640 in words is "one hundred sixty-three billion, nine hundred sixty-eight million, seven hundred fifty-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •