Base | Representation |
---|---|
bin | 101011110100011010… |
… | …010010011110001001 |
3 | 11111110000021001200121 |
4 | 223310122102132021 |
5 | 1232324323030230 |
6 | 33340425103241 |
7 | 3253643100343 |
oct | 536432223611 |
9 | 144400231617 |
10 | 47050205065 |
11 | 18a546834a6 |
12 | 9151027b21 |
13 | 458a8b6036 |
14 | 23c4a76293 |
15 | 135591b77a |
hex | af4692789 |
47050205065 has 8 divisors (see below), whose sum is σ = 56552354568. Its totient is φ = 37578758400.
The previous prime is 47050205029. The next prime is 47050205099. The reversal of 47050205065 is 56050205074.
47050205065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2699529849 + 44350675216 = 51957^2 + 210596^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 47050205065 - 231 = 44902721417 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 47050205065.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7672336 + ... + 7678465.
It is an arithmetic number, because the mean of its divisors is an integer number (7069044321).
Almost surely, 247050205065 is an apocalyptic number.
It is an amenable number.
47050205065 is a deficient number, since it is larger than the sum of its proper divisors (9502149503).
47050205065 is a wasteful number, since it uses less digits than its factorization.
47050205065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15351419.
The product of its (nonzero) digits is 42000, while the sum is 34.
Subtracting 47050205065 from its reverse (56050205074), we obtain a palindrome (9000000009).
The spelling of 47050205065 in words is "forty-seven billion, fifty million, two hundred five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •