Base | Representation |
---|---|
bin | 101011110011100100… |
… | …111000100100001101 |
3 | 11111102000220210122201 |
4 | 223303210320210031 |
5 | 1232312232032300 |
6 | 33335205041501 |
7 | 3253413101644 |
oct | 536344704415 |
9 | 144360823581 |
10 | 47036205325 |
11 | 18a4779126a |
12 | 91483b6291 |
13 | 4587a23a75 |
14 | 23c2c7035b |
15 | 13545a366a |
hex | af393890d |
47036205325 has 12 divisors (see below), whose sum is σ = 58387170100. Its totient is φ = 37588786560.
The previous prime is 47036205317. The next prime is 47036205367. The reversal of 47036205325 is 52350263074.
47036205325 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 6 ways, for example, as 20829128329 + 26207076996 = 144323^2 + 161886^2 .
It is not a de Polignac number, because 47036205325 - 23 = 47036205317 is a prime.
It is a super-2 number, since 2×470362053252 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 980550 + ... + 1027399.
Almost surely, 247036205325 is an apocalyptic number.
It is an amenable number.
47036205325 is a deficient number, since it is larger than the sum of its proper divisors (11350964775).
47036205325 is a wasteful number, since it uses less digits than its factorization.
47036205325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2008896 (or 2008891 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 37.
Adding to 47036205325 its reverse (52350263074), we get a palindrome (99386468399).
It can be divided in two parts, 470 and 36205325, that added together give a triangular number (36205795 = T8509).
The spelling of 47036205325 in words is "forty-seven billion, thirty-six million, two hundred five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •