Base | Representation |
---|---|
bin | 1000110101010101… |
… | …10101101110111001 |
3 | 110020111200010201110 |
4 | 10122222311232321 |
5 | 34203023430144 |
6 | 2102330110533 |
7 | 225343530534 |
oct | 43252655671 |
9 | 13214603643 |
10 | 4742405049 |
11 | 2013a67118 |
12 | b0427b449 |
13 | 5a768a245 |
14 | 32dba9a1b |
15 | 1cb5220b9 |
hex | 11aab5bb9 |
4742405049 has 4 divisors (see below), whose sum is σ = 6323206736. Its totient is φ = 3161603364.
The previous prime is 4742405023. The next prime is 4742405077. The reversal of 4742405049 is 9405042474.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4742405049 - 212 = 4742400953 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4742404998 and 4742405016.
It is not an unprimeable number, because it can be changed into a prime (4742405009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 790400839 + ... + 790400844.
It is an arithmetic number, because the mean of its divisors is an integer number (1580801684).
Almost surely, 24742405049 is an apocalyptic number.
It is an amenable number.
4742405049 is a deficient number, since it is larger than the sum of its proper divisors (1580801687).
4742405049 is a wasteful number, since it uses less digits than its factorization.
4742405049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1580801686.
The product of its (nonzero) digits is 161280, while the sum is 39.
The square root of 4742405049 is about 68865.1221519283. The cubic root of 4742405049 is about 1680.0912942877.
The spelling of 4742405049 in words is "four billion, seven hundred forty-two million, four hundred five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •