Base | Representation |
---|---|
bin | 101101101110110110000001… |
… | …110110011011000110101001 |
3 | 222101010221210021211021122111 |
4 | 231232312001312123012221 |
5 | 202330313200210011131 |
6 | 1551434222034522321 |
7 | 60236151454041511 |
oct | 5556660166330651 |
9 | 871127707737574 |
10 | 201131202032041 |
11 | 590a529a081886 |
12 | 1a6846a87363a1 |
13 | 882c78b4855b8 |
14 | 3794b33034841 |
15 | 183bd3de56ab1 |
hex | b6ed81d9b1a9 |
201131202032041 has 4 divisors (see below), whose sum is σ = 202254840032400. Its totient is φ = 200007564031684.
The previous prime is 201131202031987. The next prime is 201131202032077. The reversal of 201131202032041 is 140230202131102.
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 201131202032041 - 231 = 201129054548393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201131202002041) 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, 561818999911 + ... + 561819000268.
It is an arithmetic number, because the mean of its divisors is an integer number (50563710008100).
Almost surely, 2201131202032041 is an apocalyptic number.
It is an amenable number.
201131202032041 is a deficient number, since it is larger than the sum of its proper divisors (1123638000359).
201131202032041 is a wasteful number, since it uses less digits than its factorization.
201131202032041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1123638000358.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 201131202032041 its reverse (140230202131102), we get a palindrome (341361404163143).
The spelling of 201131202032041 in words is "two hundred one trillion, one hundred thirty-one billion, two hundred two million, thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.309 sec. • engine limits •