Base | Representation |
---|---|
bin | 1001001111011000… |
… | …11011101111010011 |
3 | 110210201212012001000 |
4 | 10213230123233103 |
5 | 40124444123200 |
6 | 2140133513043 |
7 | 233636116035 |
oct | 44754335723 |
9 | 13721765030 |
10 | 4960926675 |
11 | 211634a701 |
12 | b654a2783 |
13 | 610a2aa93 |
14 | 350c0dc55 |
15 | 1e07d9300 |
hex | 127b1bbd3 |
4960926675 has 36 divisors (see below), whose sum is σ = 9116768920. Its totient is φ = 2644851600.
The previous prime is 4960926671. The next prime is 4960926709. The reversal of 4960926675 is 5766290694.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
4960926675 is a `hidden beast` number, since 4 + 9 + 609 + 26 + 6 + 7 + 5 = 666.
It is not a de Polignac number, because 4960926675 - 22 = 4960926671 is a prime.
It is a super-2 number, since 2×49609266752 = 49221586949453111250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4960926671) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1828570 + ... + 1831280.
Almost surely, 24960926675 is an apocalyptic number.
4960926675 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
4960926675 is a deficient number, since it is larger than the sum of its proper divisors (4155842245).
4960926675 is an frugal number, since it uses more digits than its factorization.
4960926675 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5441 (or 2719 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 54.
The square root of 4960926675 is about 70433.8460897884. The cubic root of 4960926675 is about 1705.5099967003.
The spelling of 4960926675 in words is "four billion, nine hundred sixty million, nine hundred twenty-six thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •