Base | Representation |
---|---|
bin | 10000011010110101100010… |
… | …10110101100010010000100 |
3 | 11201211202010000110111022111 |
4 | 20031122301112230102010 |
5 | 14213032022433342311 |
6 | 204443030020510404 |
7 | 10414415000205322 |
oct | 1015326126542204 |
9 | 151752100414274 |
10 | 36106470605956 |
11 | 105607393aa633 |
12 | 4071813b4b404 |
13 | 171ba96a0a3aa |
14 | 8cb7c370cd12 |
15 | 42932b092d21 |
hex | 20d6b15ac484 |
36106470605956 has 27 divisors (see below), whose sum is σ = 64240450231503. Its totient is φ = 17756920093920.
The previous prime is 36106470605867. The next prime is 36106470605983. The reversal of 36106470605956 is 65950607460163.
The square root of 36106470605956 is 6008866.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 26764791840900 + 9341678765056 = 5173470^2 + 3056416^2 .
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 36106470605956.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 733057026 + ... + 733106278.
Almost surely, 236106470605956 is an apocalyptic number.
36106470605956 is the 6008866-th square number.
It is an amenable number.
36106470605956 is a deficient number, since it is larger than the sum of its proper divisors (28133979625547).
36106470605956 is an frugal number, since it uses more digits than its factorization.
36106470605956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98632 (or 49316 counting only the distinct ones).
The product of its (nonzero) digits is 24494400, while the sum is 58.
The spelling of 36106470605956 in words is "thirty-six trillion, one hundred six billion, four hundred seventy million, six hundred five thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •