Base | Representation |
---|---|
bin | 10010101010010011101110… |
… | …11111001010010000011010 |
3 | 12101022000101220122111001220 |
4 | 21111021313133022100122 |
5 | 20334313434241000122 |
6 | 223135422334552510 |
7 | 11433522235335312 |
oct | 1125116737122032 |
9 | 171260356574056 |
10 | 41036122203162 |
11 | 1209135a1a0929 |
12 | 47290aa368736 |
13 | 19b88c740cac8 |
14 | a1c2320aa442 |
15 | 4b269c7d325c |
hex | 2552777ca41a |
41036122203162 has 32 divisors (see below), whose sum is σ = 83818901827584. Its totient is φ = 13387600882800.
The previous prime is 41036122203161. The next prime is 41036122203173. The reversal of 41036122203162 is 26130222163014.
41036122203162 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (41036122203161) 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 in 15 ways as a sum of consecutive naturals, for example, 106988587 + ... + 107371457.
It is an arithmetic number, because the mean of its divisors is an integer number (2619340682112).
Almost surely, 241036122203162 is an apocalyptic number.
41036122203162 is an abundant number, since it is smaller than the sum of its proper divisors (42782779624422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41036122203162 is a wasteful number, since it uses less digits than its factorization.
41036122203162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 762994.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 41036122203162 its reverse (26130222163014), we get a palindrome (67166344366176).
The spelling of 41036122203162 in words is "forty-one trillion, thirty-six billion, one hundred twenty-two million, two hundred three thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •