Base | Representation |
---|---|
bin | 1001010011011100… |
… | …01100010110111001 |
3 | 110220002212100211102 |
4 | 10221232030112321 |
5 | 40212201124033 |
6 | 2143350541145 |
7 | 234531211160 |
oct | 45156142671 |
9 | 13802770742 |
10 | 4994942393 |
11 | 2133573171 |
12 | b749677b5 |
13 | 617aaa81c |
14 | 3555463d7 |
15 | 1e37a7de8 |
hex | 129b8c5b9 |
4994942393 has 32 divisors (see below), whose sum is σ = 5959489536. Its totient is φ = 4097858688.
The previous prime is 4994942369. The next prime is 4994942399. The reversal of 4994942393 is 3932494994.
4994942393 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4994942393 - 226 = 4927833529 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4994942399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4698380 + ... + 4699442.
It is an arithmetic number, because the mean of its divisors is an integer number (186234048).
Almost surely, 24994942393 is an apocalyptic number.
4994942393 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
4994942393 is a deficient number, since it is larger than the sum of its proper divisors (964547143).
4994942393 is a wasteful number, since it uses less digits than its factorization.
4994942393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413.
The product of its digits is 7558272, while the sum is 56.
The square root of 4994942393 is about 70674.9063883356. The cubic root of 4994942393 is about 1709.3991930789.
The spelling of 4994942393 in words is "four billion, nine hundred ninety-four million, nine hundred forty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •