Base | Representation |
---|---|
bin | 10000100010000011111110… |
… | …11000000010001001111101 |
3 | 11202201110221100111121210112 |
4 | 20101001333120002021331 |
5 | 14231114001442400221 |
6 | 205153045335515405 |
7 | 10441354232014043 |
oct | 1021017730021175 |
9 | 152643840447715 |
10 | 36354740200061 |
11 | 10646a60093268 |
12 | 40b1960b28b65 |
13 | 173931143506a |
14 | 8d98163a2393 |
15 | 430a0beee15b |
hex | 21107f60227d |
36354740200061 has 4 divisors (see below), whose sum is σ = 36355616956512. Its totient is φ = 36353863443612.
The previous prime is 36354740200019. The next prime is 36354740200091. The reversal of 36354740200061 is 16000204745363.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 36354740200061 - 26 = 36354740199997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 36354740199991 and 36354740200018.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36354740200091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 438316025 + ... + 438398958.
It is an arithmetic number, because the mean of its divisors is an integer number (9088904239128).
Almost surely, 236354740200061 is an apocalyptic number.
It is an amenable number.
36354740200061 is a deficient number, since it is larger than the sum of its proper divisors (876756451).
36354740200061 is an equidigital number, since it uses as much as digits as its factorization.
36354740200061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876756450.
The product of its (nonzero) digits is 362880, while the sum is 41.
The spelling of 36354740200061 in words is "thirty-six trillion, three hundred fifty-four billion, seven hundred forty million, two hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •