Base | Representation |
---|---|
bin | 1000101101111110… |
… | …11111110011010001 |
3 | 110002012120202220122 |
4 | 10112333133303101 |
5 | 34041230231002 |
6 | 2052243520025 |
7 | 223664250566 |
oct | 42677376321 |
9 | 13065522818 |
10 | 4680711377 |
11 | 1a92159811 |
12 | aa7689015 |
13 | 597969404 |
14 | 32590a86d |
15 | 1c5dd76a2 |
hex | 116fdfcd1 |
4680711377 has 8 divisors (see below), whose sum is σ = 4816250280. Its totient is φ = 4546921600.
The previous prime is 4680711361. The next prime is 4680711401. The reversal of 4680711377 is 7731170864.
It can be written as a sum of positive squares in 4 ways, for example, as 3599880001 + 1080831376 = 59999^2 + 32876^2 .
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 4680711377 - 24 = 4680711361 is a prime.
It is a super-2 number, since 2×46807113772 = 43818117989554472258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4680711977) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 431852 + ... + 442557.
It is an arithmetic number, because the mean of its divisors is an integer number (602031285).
Almost surely, 24680711377 is an apocalyptic number.
It is an amenable number.
4680711377 is a deficient number, since it is larger than the sum of its proper divisors (135538903).
4680711377 is a wasteful number, since it uses less digits than its factorization.
4680711377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874563.
The product of its (nonzero) digits is 197568, while the sum is 44.
The square root of 4680711377 is about 68415.7246325726. The cubic root of 4680711377 is about 1672.7740687976.
The spelling of 4680711377 in words is "four billion, six hundred eighty million, seven hundred eleven thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •