Base | Representation |
---|---|
bin | 101100011011011101… |
… | …101001000011100101 |
3 | 11120010200010011220101 |
4 | 230123131221003211 |
5 | 1240200040123204 |
6 | 33525432104101 |
7 | 3306120112336 |
oct | 543335510345 |
9 | 146120104811 |
10 | 47705395429 |
11 | 192604a773a |
12 | 92b4535031 |
13 | 4663566643 |
14 | 2447aa828d |
15 | 13931dbea4 |
hex | b1b7690e5 |
47705395429 has 4 divisors (see below), whose sum is σ = 47915551584. Its totient is φ = 47495239276.
The previous prime is 47705395417. The next prime is 47705395457. The reversal of 47705395429 is 92459350774.
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 a de Polignac number, because none of the positive numbers 2k-47705395429 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 47705395429.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47705395229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105077737 + ... + 105078190.
It is an arithmetic number, because the mean of its divisors is an integer number (11978887896).
Almost surely, 247705395429 is an apocalyptic number.
It is an amenable number.
47705395429 is a deficient number, since it is larger than the sum of its proper divisors (210156155).
47705395429 is a wasteful number, since it uses less digits than its factorization.
47705395429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210156154.
The product of its (nonzero) digits is 9525600, while the sum is 55.
The spelling of 47705395429 in words is "forty-seven billion, seven hundred five million, three hundred ninety-five thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •