Base | Representation |
---|---|
bin | 11001100001010… |
… | …11010100110000 |
3 | 112220211202002200 |
4 | 30300223110300 |
5 | 414301240320 |
6 | 33124343200 |
7 | 5206465143 |
oct | 1460532460 |
9 | 486752080 |
10 | 214086960 |
11 | aa93477a |
12 | 5b844b00 |
13 | 3547a199 |
14 | 2060c05a |
15 | 13bdd290 |
hex | cc2b530 |
214086960 has 120 divisors (see below), whose sum is σ = 721724640. Its totient is φ = 56871936.
The previous prime is 214086941. The next prime is 214087039. The reversal of 214086960 is 69680412.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 294117 + ... + 294843.
It is an arithmetic number, because the mean of its divisors is an integer number (6014372).
Almost surely, 2214086960 is an apocalyptic number.
214086960 is a gapful number since it is divisible by the number (20) 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 214086960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (360862320).
214086960 is an abundant number, since it is smaller than the sum of its proper divisors (507637680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214086960 is a wasteful number, since it uses less digits than its factorization.
214086960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1155 (or 1146 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 214086960 is about 14631.7107680544. The cubic root of 214086960 is about 598.2234114137.
The spelling of 214086960 in words is "two hundred fourteen million, eighty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •