Base | Representation |
---|---|
bin | 1001001000111011… |
… | …00111110101110011 |
3 | 110122221211211002012 |
4 | 10210131213311303 |
5 | 40022104244220 |
6 | 2130515513135 |
7 | 232410240032 |
oct | 44435476563 |
9 | 13587754065 |
10 | 4906712435 |
11 | 2098790749 |
12 | b4b2b87ab |
13 | 602728451 |
14 | 34793a719 |
15 | 1dab7aac5 |
hex | 124767d73 |
4906712435 has 8 divisors (see below), whose sum is σ = 5896026960. Its totient is φ = 3920055264.
The previous prime is 4906712423. The next prime is 4906712443. The reversal of 4906712435 is 5342176094.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4906712435 - 230 = 3832970611 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4906712392 and 4906712401.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 660272 + ... + 667661.
It is an arithmetic number, because the mean of its divisors is an integer number (737003370).
Almost surely, 24906712435 is an apocalyptic number.
4906712435 is a deficient number, since it is larger than the sum of its proper divisors (989314525).
4906712435 is a wasteful number, since it uses less digits than its factorization.
4906712435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1328677.
The product of its (nonzero) digits is 181440, while the sum is 41.
The square root of 4906712435 is about 70047.9295554123. The cubic root of 4906712435 is about 1699.2744810675.
The spelling of 4906712435 in words is "four billion, nine hundred six million, seven hundred twelve thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •