Base | Representation |
---|---|
bin | 1001001110011110… |
… | …11001000110010000 |
3 | 110210012112101222020 |
4 | 10213033121012100 |
5 | 40121022014210 |
6 | 2135302411440 |
7 | 233514320520 |
oct | 44717310620 |
9 | 13705471866 |
10 | 4953313680 |
11 | 211201a977 |
12 | b62a30b80 |
13 | 60c293853 |
14 | 34dbcb680 |
15 | 1decd3770 |
hex | 1273d9190 |
4953313680 has 320 divisors, whose sum is σ = 19113062400. Its totient is φ = 1035417600.
The previous prime is 4953313627. The next prime is 4953313693. The reversal of 4953313680 is 863133594.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 923005 + ... + 928355.
It is an arithmetic number, because the mean of its divisors is an integer number (59728320).
Almost surely, 24953313680 is an apocalyptic number.
4953313680 is a gapful number since it is divisible by the number (40) 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 4953313680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9556531200).
4953313680 is an abundant number, since it is smaller than the sum of its proper divisors (14159748720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4953313680 is a wasteful number, since it uses less digits than its factorization.
4953313680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5422 (or 5416 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 42.
The square root of 4953313680 is about 70379.7817558424. The cubic root of 4953313680 is about 1704.6371297726.
The spelling of 4953313680 in words is "four billion, nine hundred fifty-three million, three hundred thirteen thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •