Base | Representation |
---|---|
bin | 10000100000111010111011… |
… | …01010111000011100100111 |
3 | 11202120201201000210112110111 |
4 | 20100131131222320130213 |
5 | 14224443141110310043 |
6 | 205123041455033451 |
7 | 10435465303626502 |
oct | 1020353552703447 |
9 | 152521630715414 |
10 | 36315520010023 |
11 | 10631364335a71 |
12 | 40a623620b887 |
13 | 1735700ab6917 |
14 | 8d79755c6139 |
15 | 42e9b3c0209d |
hex | 21075dab8727 |
36315520010023 has 2 divisors, whose sum is σ = 36315520010024. Its totient is φ = 36315520010022.
The previous prime is 36315520009969. The next prime is 36315520010047. The reversal of 36315520010023 is 32001002551363.
36315520010023 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 a cyclic number.
It is not a de Polignac number, because 36315520010023 - 245 = 1131147921191 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (36315520010923) 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, 18157760005011 + 18157760005012.
It is an arithmetic number, because the mean of its divisors is an integer number (18157760005012).
Almost surely, 236315520010023 is an apocalyptic number.
36315520010023 is a deficient number, since it is larger than the sum of its proper divisors (1).
36315520010023 is an equidigital number, since it uses as much as digits as its factorization.
36315520010023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 36315520010023 its reverse (32001002551363), we get a palindrome (68316522561386).
The spelling of 36315520010023 in words is "thirty-six trillion, three hundred fifteen billion, five hundred twenty million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •