Base | Representation |
---|---|
bin | 10100000011011… |
… | …00001000010000 |
3 | 102201112012200021 |
4 | 22001230020100 |
5 | 321030340211 |
6 | 24405233224 |
7 | 4111542622 |
oct | 1201541020 |
9 | 381465607 |
10 | 168215056 |
11 | 86a53509 |
12 | 48402814 |
13 | 28b08a49 |
14 | 184aac12 |
15 | eb7b771 |
hex | a06c210 |
168215056 has 40 divisors (see below), whose sum is σ = 345850880. Its totient is φ = 79035264.
The previous prime is 168215029. The next prime is 168215093. The reversal of 168215056 is 650512861.
It is a happy number.
168215056 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36430 + ... + 40786.
It is an arithmetic number, because the mean of its divisors is an integer number (8646272).
Almost surely, 2168215056 is an apocalyptic number.
168215056 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 168215056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172925440).
168215056 is an abundant number, since it is smaller than the sum of its proper divisors (177635824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168215056 is a wasteful number, since it uses less digits than its factorization.
168215056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4511 (or 4505 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 34.
The square root of 168215056 is about 12969.7747089146. The cubic root of 168215056 is about 552.0201805967.
The spelling of 168215056 in words is "one hundred sixty-eight million, two hundred fifteen thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •