Base | Representation |
---|---|
bin | 1001100000000100000… |
… | …1110100011110101100 |
3 | 120121022111112111220201 |
4 | 2120001001310132230 |
5 | 10133241324332224 |
6 | 202552431523244 |
7 | 14535615130510 |
oct | 2300101643654 |
9 | 517274474821 |
10 | 163226011564 |
11 | 63250912420 |
12 | 27774089524 |
13 | 12513714bc5 |
14 | 7c86150140 |
15 | 43a4cc7a44 |
hex | 26010747ac |
163226011564 has 192 divisors, whose sum is σ = 381250437120. Its totient is φ = 59195520000.
The previous prime is 163226011549. The next prime is 163226011573. The reversal of 163226011564 is 465110622361.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 340763877 + ... + 340764355.
It is an arithmetic number, because the mean of its divisors is an integer number (1985679360).
Almost surely, 2163226011564 is an apocalyptic number.
163226011564 is a gapful number since it is divisible by the number (14) 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 163226011564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190625218560).
163226011564 is an abundant number, since it is smaller than the sum of its proper divisors (218024425556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163226011564 is a wasteful number, since it uses less digits than its factorization.
163226011564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100 (or 1098 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 163226011564 in words is "one hundred sixty-three billion, two hundred twenty-six million, eleven thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •