Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …010011100101110001101011 |
3 | 222100200112020102202210112121 |
4 | 231230330331103211301223 |
5 | 202321200430433444042 |
6 | 1551254402233052111 |
7 | 60223600121545141 |
oct | 5554747523456153 |
9 | 870615212683477 |
10 | 201001203031147 |
11 | 5905514a025362 |
12 | 1a663468257037 |
13 | 882044187076c |
14 | 378c71db49591 |
15 | 183878123e367 |
hex | b6cf3d4e5c6b |
201001203031147 has 2 divisors, whose sum is σ = 201001203031148. Its totient is φ = 201001203031146.
The previous prime is 201001203031091. The next prime is 201001203031159. The reversal of 201001203031147 is 741130302100102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201001203031147 - 27 = 201001203031019 is a prime.
It is not a weakly prime, because it can be changed into another prime (201001203631147) 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, 100500601515573 + 100500601515574.
It is an arithmetic number, because the mean of its divisors is an integer number (100500601515574).
Almost surely, 2201001203031147 is an apocalyptic number.
201001203031147 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001203031147 is an equidigital number, since it uses as much as digits as its factorization.
201001203031147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
Adding to 201001203031147 its reverse (741130302100102), we get a palindrome (942131505131249).
The spelling of 201001203031147 in words is "two hundred one trillion, one billion, two hundred three million, thirty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •