Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …101111000001000111110011 |
3 | 222100200112020221022002020001 |
4 | 231230330331233001013303 |
5 | 202321200434304033133 |
6 | 1551254403051130431 |
7 | 60223600236632011 |
oct | 5554747557010763 |
9 | 870615227262201 |
10 | 201001210221043 |
11 | 59055153096221 |
12 | 1a66346a743a17 |
13 | 88204431ba23b |
14 | 378c720a9b8b1 |
15 | 1838781bae87d |
hex | b6cf3dbc11f3 |
201001210221043 has 2 divisors, whose sum is σ = 201001210221044. Its totient is φ = 201001210221042.
The previous prime is 201001210220969. The next prime is 201001210221059. The reversal of 201001210221043 is 340122012100102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201001210221043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201001210221043.
It is not a weakly prime, because it can be changed into another prime (201001210225043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500605110521 + 100500605110522.
It is an arithmetic number, because the mean of its divisors is an integer number (100500605110522).
Almost surely, 2201001210221043 is an apocalyptic number.
201001210221043 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001210221043 is an equidigital number, since it uses as much as digits as its factorization.
201001210221043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 201001210221043 its reverse (340122012100102), we get a palindrome (541123222321145).
The spelling of 201001210221043 in words is "two hundred one trillion, one billion, two hundred ten million, two hundred twenty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •