Base | Representation |
---|---|
bin | 100100001100100… |
… | …1100011010001100 |
3 | 10010122102020120010 |
4 | 1020121030122030 |
5 | 4441412021410 |
6 | 320304153220 |
7 | 42045423600 |
oct | 11031143214 |
9 | 3118366503 |
10 | 1214563980 |
11 | 573653993 |
12 | 29a908810 |
13 | 164823516 |
14 | b7441500 |
15 | 71965c20 |
hex | 4864c68c |
1214563980 has 288 divisors, whose sum is σ = 4412620800. Its totient is φ = 247339008.
The previous prime is 1214563943. The next prime is 1214563981. The reversal of 1214563980 is 893654121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1214563981) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 948981 + ... + 950259.
It is an arithmetic number, because the mean of its divisors is an integer number (15321600).
Almost surely, 21214563980 is an apocalyptic number.
1214563980 is a gapful number since it is divisible by the number (10) 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 1214563980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2206310400).
1214563980 is an abundant number, since it is smaller than the sum of its proper divisors (3198056820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1214563980 is a wasteful number, since it uses less digits than its factorization.
1214563980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1341 (or 1332 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 1214563980 is about 34850.5951168700. The cubic root of 1214563980 is about 1066.9403319089.
The spelling of 1214563980 in words is "one billion, two hundred fourteen million, five hundred sixty-three thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •