Base | Representation |
---|---|
bin | 10000011110011111010000… |
… | …10011001010101001001111 |
3 | 11202021201222122110100010101 |
4 | 20033033220103022221033 |
5 | 14222111011244331312 |
6 | 205020420524151531 |
7 | 10426446260430562 |
oct | 1017175023125117 |
9 | 152251878410111 |
10 | 36231946480207 |
11 | 105a9978250065 |
12 | 4091bb16985a7 |
13 | 172a87250c12a |
14 | 8d38c7dcc4d9 |
15 | 42c721b4ea57 |
hex | 20f3e84caa4f |
36231946480207 has 2 divisors, whose sum is σ = 36231946480208. Its totient is φ = 36231946480206.
The previous prime is 36231946480159. The next prime is 36231946480211. The reversal of 36231946480207 is 70208464913263.
36231946480207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (70208464913263) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36231946480207 - 227 = 36231812262479 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (36231946480237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18115973240103 + 18115973240104.
It is an arithmetic number, because the mean of its divisors is an integer number (18115973240104).
Almost surely, 236231946480207 is an apocalyptic number.
36231946480207 is a deficient number, since it is larger than the sum of its proper divisors (1).
36231946480207 is an equidigital number, since it uses as much as digits as its factorization.
36231946480207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10450944, while the sum is 55.
The spelling of 36231946480207 in words is "thirty-six trillion, two hundred thirty-one billion, nine hundred forty-six million, four hundred eighty thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •