Base | Representation |
---|---|
bin | 101101101110011000111110… |
… | …000100001000011111001001 |
3 | 222101000222020202201000211211 |
4 | 231232120332010020133021 |
5 | 202324310300000112131 |
6 | 1551412021543053121 |
7 | 60233665320140035 |
oct | 5556307604103711 |
9 | 871028222630754 |
10 | 201100000004041 |
11 | 59093038377386 |
12 | 1a67a63b1411a1 |
13 | 8829858068c38 |
14 | 37934130cd1c5 |
15 | 183b114a415b1 |
hex | b6e63e1087c9 |
201100000004041 has 2 divisors, whose sum is σ = 201100000004042. Its totient is φ = 201100000004040.
The previous prime is 201100000003909. The next prime is 201100000004077. The reversal of 201100000004041 is 140400000001102.
201100000004041 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 can be written as a sum of positive squares in only one way, i.e., 171586813783225 + 29513186220816 = 13099115^2 + 5432604^2 .
It is a cyclic number.
It is not a de Polignac number, because 201100000004041 - 223 = 201099991615433 is a prime.
It is not a weakly prime, because it can be changed into another prime (201100000004341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550000002020 + 100550000002021.
It is an arithmetic number, because the mean of its divisors is an integer number (100550000002021).
Almost surely, 2201100000004041 is an apocalyptic number.
It is an amenable number.
201100000004041 is a deficient number, since it is larger than the sum of its proper divisors (1).
201100000004041 is an equidigital number, since it uses as much as digits as its factorization.
201100000004041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201100000004041 its reverse (140400000001102), we get a palindrome (341500000005143).
The spelling of 201100000004041 in words is "two hundred one trillion, one hundred billion, four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •