Base | Representation |
---|---|
bin | 1000110110010000… |
… | …10000011101001101 |
3 | 110021001011221002121 |
4 | 10123020100131031 |
5 | 34212012213220 |
6 | 2103203252541 |
7 | 225466216456 |
oct | 43310203515 |
9 | 13231157077 |
10 | 4750116685 |
11 | 2018353a76 |
12 | b0697a151 |
13 | 5a915a342 |
14 | 330c1612d |
15 | 1cc046eaa |
hex | 11b21074d |
4750116685 has 4 divisors (see below), whose sum is σ = 5700140028. Its totient is φ = 3800093344.
The previous prime is 4750116677. The next prime is 4750116689. The reversal of 4750116685 is 5866110574.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3590646084 + 1159470601 = 59922^2 + 34051^2 .
It is a cyclic number.
It is not a de Polignac number, because 4750116685 - 23 = 4750116677 is a prime.
It is a super-2 number, since 2×47501166852 = 45127217042230778450, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4750116689) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 475011664 + ... + 475011673.
It is an arithmetic number, because the mean of its divisors is an integer number (1425035007).
Almost surely, 24750116685 is an apocalyptic number.
It is an amenable number.
4750116685 is a deficient number, since it is larger than the sum of its proper divisors (950023343).
4750116685 is an equidigital number, since it uses as much as digits as its factorization.
4750116685 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 950023342.
The product of its (nonzero) digits is 201600, while the sum is 43.
The square root of 4750116685 is about 68921.0902772149. The cubic root of 4750116685 is about 1681.0014679219.
The spelling of 4750116685 in words is "four billion, seven hundred fifty million, one hundred sixteen thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •