Base | Representation |
---|---|
bin | 1001011100100111… |
… | …11100001110000101 |
3 | 111002110202120210011 |
4 | 10232103330032011 |
5 | 40341404243004 |
6 | 2155141230221 |
7 | 236454556261 |
oct | 45623741605 |
9 | 14073676704 |
10 | 5071946629 |
11 | 2172a88632 |
12 | b96702371 |
13 | 62aa2c469 |
14 | 36186d0a1 |
15 | 1ea419004 |
hex | 12e4fc385 |
5071946629 has 4 divisors (see below), whose sum is σ = 5072255884. Its totient is φ = 5071637376.
The previous prime is 5071946609. The next prime is 5071946647. The reversal of 5071946629 is 9266491705.
It is a happy number.
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 905889604 + 4166057025 = 30098^2 + 64545^2 .
It is a cyclic number.
It is not a de Polignac number, because 5071946629 - 25 = 5071946597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5071946609) 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, 128562 + ... + 163315.
It is an arithmetic number, because the mean of its divisors is an integer number (1268063971).
Almost surely, 25071946629 is an apocalyptic number.
It is an amenable number.
5071946629 is a deficient number, since it is larger than the sum of its proper divisors (309255).
5071946629 is a wasteful number, since it uses less digits than its factorization.
5071946629 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309254.
The product of its (nonzero) digits is 816480, while the sum is 49.
The square root of 5071946629 is about 71217.6005563232. The cubic root of 5071946629 is about 1718.1387190503.
The spelling of 5071946629 in words is "five billion, seventy-one million, nine hundred forty-six thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •