Base | Representation |
---|---|
bin | 100010010001001001… |
… | …111110001111110011 |
3 | 10111222022101011011122 |
4 | 202101021332033303 |
5 | 1100324013031242 |
6 | 24523045332455 |
7 | 2441546520116 |
oct | 422111761763 |
9 | 114868334148 |
10 | 36795048947 |
11 | 14671933968 |
12 | 716a70712b |
13 | 361509c317 |
14 | 1ad0a9457d |
15 | e5545bad2 |
hex | 89127e3f3 |
36795048947 has 2 divisors, whose sum is σ = 36795048948. Its totient is φ = 36795048946.
The previous prime is 36795048943. The next prime is 36795048949. The reversal of 36795048947 is 74984059763.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 36795048947 - 22 = 36795048943 is a prime.
Together with 36795048949, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 36795048947.
It is not a weakly prime, because it can be changed into another prime (36795048943) 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 as a sum of consecutive naturals, namely, 18397524473 + 18397524474.
It is an arithmetic number, because the mean of its divisors is an integer number (18397524474).
Almost surely, 236795048947 is an apocalyptic number.
36795048947 is a deficient number, since it is larger than the sum of its proper divisors (1).
36795048947 is an equidigital number, since it uses as much as digits as its factorization.
36795048947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45722880, while the sum is 62.
The spelling of 36795048947 in words is "thirty-six billion, seven hundred ninety-five million, forty-eight thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •