Base | Representation |
---|---|
bin | 10010101110101… |
… | …001110111100000 |
3 | 210220021000210210 |
4 | 102232221313200 |
5 | 1120420020000 |
6 | 51102454120 |
7 | 10533553203 |
oct | 2256516740 |
9 | 726230723 |
10 | 314220000 |
11 | 151407156 |
12 | 89294340 |
13 | 501393c3 |
14 | 2da3593a |
15 | 1c8bc350 |
hex | 12ba9de0 |
314220000 has 120 divisors (see below), whose sum is σ = 1030901256. Its totient is φ = 83776000.
The previous prime is 314219933. The next prime is 314220013. The reversal of 314220000 is 22413.
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 (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 57382 + ... + 62618.
Almost surely, 2314220000 is an apocalyptic number.
314220000 is a gapful number since it is divisible by the number (30) 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 314220000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (515450628).
314220000 is an abundant number, since it is smaller than the sum of its proper divisors (716681256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
314220000 is an equidigital number, since it uses as much as digits as its factorization.
314220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5270 (or 5247 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 314220000 is about 17726.2517188491. The cubic root of 314220000 is about 679.8471398042.
Adding to 314220000 its reverse (22413), we get a palindrome (314242413).
The spelling of 314220000 in words is "three hundred fourteen million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •