Base | Representation |
---|---|
bin | 100100000100101101000… |
… | …0010111111001111101100 |
3 | 122112222012210011120020020 |
4 | 1020021122002333033230 |
5 | 1122212241131223424 |
6 | 14313343523322140 |
7 | 1021124313046350 |
oct | 110113202771754 |
9 | 18488183146206 |
10 | 4957902992364 |
11 | 16416a8a94663 |
12 | 680a5b820350 |
13 | 29c6b3730baa |
14 | 131d6c8ab460 |
15 | 88e76ab4079 |
hex | 4825a0bf3ec |
4957902992364 has 768 divisors, whose sum is σ = 15867784396800. Its totient is φ = 1173898801152.
The previous prime is 4957902992363. The next prime is 4957902992377. The reversal of 4957902992364 is 4632992097594.
It is a Harshad number since it is a multiple of its sum of digits (69).
It is not an unprimeable number, because it can be changed into a prime (4957902992363) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 6672816577 + ... + 6672817319.
It is an arithmetic number, because the mean of its divisors is an integer number (20661177600).
Almost surely, 24957902992364 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 4957902992364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7933892198400).
4957902992364 is an abundant number, since it is smaller than the sum of its proper divisors (10909881404436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4957902992364 is a wasteful number, since it uses less digits than its factorization.
4957902992364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 887 (or 851 counting only the distinct ones).
The product of its (nonzero) digits is 264539520, while the sum is 69.
The spelling of 4957902992364 in words is "four trillion, nine hundred fifty-seven billion, nine hundred two million, nine hundred ninety-two thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •