Base | Representation |
---|---|
bin | 100011101110101100001… |
… | …1111111000111111111000 |
3 | 122101110012102011100200220 |
4 | 1013131120133320333320 |
5 | 1120423433341434024 |
6 | 14235525142100040 |
7 | 1014532022322261 |
oct | 107353037707770 |
9 | 18343172140626 |
10 | 4910632374264 |
11 | 1623650a56631 |
12 | 673868a1a620 |
13 | 2980bc294456 |
14 | 12d96685b968 |
15 | 87b0bb59e79 |
hex | 477587f8ff8 |
4910632374264 has 128 divisors (see below), whose sum is σ = 12722987796480. Its totient is φ = 1579430100480.
The previous prime is 4910632374199. The next prime is 4910632374287. The reversal of 4910632374264 is 4624732360194.
It is a super-2 number, since 2×49106323742642 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 248089552 + ... + 248109344.
It is an arithmetic number, because the mean of its divisors is an integer number (99398342160).
Almost surely, 24910632374264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4910632374264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6361493898240).
4910632374264 is an abundant number, since it is smaller than the sum of its proper divisors (7812355422216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4910632374264 is a wasteful number, since it uses less digits than its factorization.
4910632374264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20242 (or 20176 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 51.
The spelling of 4910632374264 in words is "four trillion, nine hundred ten billion, six hundred thirty-two million, three hundred seventy-four thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •