Base | Representation |
---|---|
bin | 1000111011010111… |
… | …00010100101110001 |
3 | 110101000201120210121 |
4 | 10131223202211301 |
5 | 34303441423213 |
6 | 2111332530241 |
7 | 226526102650 |
oct | 43553424561 |
9 | 13330646717 |
10 | 4792920433 |
11 | 203a52a074 |
12 | b19180981 |
13 | 5b4c960c2 |
14 | 336799197 |
15 | 1d0b9e88d |
hex | 11dae2971 |
4792920433 has 8 divisors (see below), whose sum is σ = 5580975168. Its totient is φ = 4030703664.
The previous prime is 4792920421. The next prime is 4792920439. The reversal of 4792920433 is 3340292974.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4792920433 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4792920433.
It is not an unprimeable number, because it can be changed into a prime (4792920439) 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 7 ways as a sum of consecutive naturals, for example, 6459091 + ... + 6459832.
It is an arithmetic number, because the mean of its divisors is an integer number (697621896).
Almost surely, 24792920433 is an apocalyptic number.
It is an amenable number.
4792920433 is a deficient number, since it is larger than the sum of its proper divisors (788054735).
4792920433 is a wasteful number, since it uses less digits than its factorization.
4792920433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12918983.
The product of its (nonzero) digits is 326592, while the sum is 43.
The square root of 4792920433 is about 69230.9210757736. The cubic root of 4792920433 is about 1686.0355978116.
The spelling of 4792920433 in words is "four billion, seven hundred ninety-two million, nine hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •