Base | Representation |
---|---|
bin | 100001110110111010… |
… | …000000011111100001 |
3 | 10110211121200212221002 |
4 | 201312322000133201 |
5 | 1043423242444400 |
6 | 24411234241345 |
7 | 2424621323246 |
oct | 416672003741 |
9 | 113747625832 |
10 | 36354656225 |
11 | 1446628a338 |
12 | 7067126255 |
13 | 3574a87504 |
14 | 1a8c3b75cd |
15 | e2b969ed5 |
hex | 876e807e1 |
36354656225 has 12 divisors (see below), whose sum is σ = 45233638716. Its totient is φ = 28984457280.
The previous prime is 36354656201. The next prime is 36354656237. The reversal of 36354656225 is 52265645363.
It can be written as a sum of positive squares in 6 ways, for example, as 497825344 + 35856830881 = 22312^2 + 189359^2 .
It is not a de Polignac number, because 36354656225 - 26 = 36354656161 is a prime.
It is a super-2 number, since 2×363546562252 (a number of 22 digits) contains 22 as substring.
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 36354656225.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 2474222 + ... + 2488871.
It is an arithmetic number, because the mean of its divisors is an integer number (3769469893).
Almost surely, 236354656225 is an apocalyptic number.
It is an amenable number.
36354656225 is a deficient number, since it is larger than the sum of its proper divisors (8878982491).
36354656225 is a wasteful number, since it uses less digits than its factorization.
36354656225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4963396 (or 4963391 counting only the distinct ones).
The product of its digits is 3888000, while the sum is 47.
The spelling of 36354656225 in words is "thirty-six billion, three hundred fifty-four million, six hundred fifty-six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •