Base | Representation |
---|---|
bin | 1001100000001010… |
… | …11010111010001001 |
3 | 111011112201221022220 |
4 | 10300011122322021 |
5 | 40422013211401 |
6 | 2202123004253 |
7 | 240265455123 |
oct | 46005327211 |
9 | 14145657286 |
10 | 5101694601 |
11 | 2188856733 |
12 | ba4669689 |
13 | 633c46803 |
14 | 3657b4213 |
15 | 1ecd43336 |
hex | 13015ae89 |
5101694601 has 4 divisors (see below), whose sum is σ = 6802259472. Its totient is φ = 3401129732.
The previous prime is 5101694599. The next prime is 5101694603. The reversal of 5101694601 is 1064961015.
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 an interprime number because it is at equal distance from previous prime (5101694599) and next prime (5101694603).
It is a cyclic number.
It is not a de Polignac number, because 5101694601 - 21 = 5101694599 is a prime.
It is a super-4 number, since 4×51016946014 (a number of 40 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (5101694603) 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, 850282431 + ... + 850282436.
It is an arithmetic number, because the mean of its divisors is an integer number (1700564868).
Almost surely, 25101694601 is an apocalyptic number.
It is an amenable number.
5101694601 is a deficient number, since it is larger than the sum of its proper divisors (1700564871).
5101694601 is a wasteful number, since it uses less digits than its factorization.
5101694601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1700564870.
The product of its (nonzero) digits is 6480, while the sum is 33.
The square root of 5101694601 is about 71426.1478801706. The cubic root of 5101694601 is about 1721.4912478335.
The spelling of 5101694601 in words is "five billion, one hundred one million, six hundred ninety-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •