Base | Representation |
---|---|
bin | 10000101000100100001100… |
… | …11111110111001001101011 |
3 | 11210111211201111202121102101 |
4 | 20110102012133313021223 |
5 | 14243244122141221133 |
6 | 205443443035514231 |
7 | 10463454562632121 |
oct | 1024220637671153 |
9 | 153454644677371 |
10 | 36578197992043 |
11 | 107227aa1a1804 |
12 | 41291245b8977 |
13 | 175440360a906 |
14 | 906573a9b911 |
15 | 436739a6037d |
hex | 2144867f726b |
36578197992043 has 2 divisors, whose sum is σ = 36578197992044. Its totient is φ = 36578197992042.
The previous prime is 36578197991971. The next prime is 36578197992107. The reversal of 36578197992043 is 34029979187563.
36578197992043 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 36578197992043 - 213 = 36578197983851 is a prime.
It is not a weakly prime, because it can be changed into another prime (36578197912043) 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, 18289098996021 + 18289098996022.
It is an arithmetic number, because the mean of its divisors is an integer number (18289098996022).
It is a 1-persistent number, because it is pandigital, but 2⋅36578197992043 = 73156395984086 is not.
Almost surely, 236578197992043 is an apocalyptic number.
36578197992043 is a deficient number, since it is larger than the sum of its proper divisors (1).
36578197992043 is an equidigital number, since it uses as much as digits as its factorization.
36578197992043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 617258880, while the sum is 73.
The spelling of 36578197992043 in words is "thirty-six trillion, five hundred seventy-eight billion, one hundred ninety-seven million, nine hundred ninety-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •