Base | Representation |
---|---|
bin | 1001010111010110… |
… | …00010001111011001 |
3 | 110222101110001020020 |
4 | 10223223002033121 |
5 | 40244040401303 |
6 | 2150520221053 |
7 | 235406323656 |
oct | 45353021731 |
9 | 13871401206 |
10 | 5027668953 |
11 | 214aa9610a |
12 | b8390a789 |
13 | 6217c8858 |
14 | 359a24c2d |
15 | 1e65bea53 |
hex | 12bac23d9 |
5027668953 has 4 divisors (see below), whose sum is σ = 6703558608. Its totient is φ = 3351779300.
The previous prime is 5027668951. The next prime is 5027668957. The reversal of 5027668953 is 3598667205.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 5027668953 - 21 = 5027668951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5027668896 and 5027668905.
It is not an unprimeable number, because it can be changed into a prime (5027668951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 837944823 + ... + 837944828.
It is an arithmetic number, because the mean of its divisors is an integer number (1675889652).
Almost surely, 25027668953 is an apocalyptic number.
It is an amenable number.
5027668953 is a deficient number, since it is larger than the sum of its proper divisors (1675889655).
5027668953 is a wasteful number, since it uses less digits than its factorization.
5027668953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1675889654.
The product of its (nonzero) digits is 2721600, while the sum is 51.
The square root of 5027668953 is about 70906.0572377283. The cubic root of 5027668953 is about 1713.1243625141.
The spelling of 5027668953 in words is "five billion, twenty-seven million, six hundred sixty-eight thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •