Base | Representation |
---|---|
bin | 1001100010010011101… |
… | …0010011011000000000 |
3 | 120122212110022202020201 |
4 | 2120210322103120000 |
5 | 10141004433130421 |
6 | 203132255014544 |
7 | 14556545125342 |
oct | 2304472233000 |
9 | 518773282221 |
10 | 163828020736 |
11 | 6352a712866 |
12 | 2790180a454 |
13 | 125ab365153 |
14 | 7d0209b292 |
15 | 43dca90b91 |
hex | 2624e93600 |
163828020736 has 40 divisors (see below), whose sum is σ = 327820268160. Its totient is φ = 81792841728.
The previous prime is 163828020721. The next prime is 163828020737. The reversal of 163828020736 is 637020828361.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163828020737) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110305 + ... + 582943.
It is an arithmetic number, because the mean of its divisors is an integer number (8195506704).
Almost surely, 2163828020736 is an apocalyptic number.
163828020736 is a gapful number since it is divisible by the number (16) 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 163828020736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163910134080).
163828020736 is an abundant number, since it is smaller than the sum of its proper divisors (163992247424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163828020736 is an frugal number, since it uses more digits than its factorization.
163828020736 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 473334 (or 473318 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 46.
The spelling of 163828020736 in words is "one hundred sixty-three billion, eight hundred twenty-eight million, twenty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •