Base | Representation |
---|---|
bin | 101101110001101111010111… |
… | …001011100001011110100111 |
3 | 222101211222102221121021122021 |
4 | 231301233113023201132213 |
5 | 202342043223220402101 |
6 | 1552105452405244011 |
7 | 60256425043641364 |
oct | 5561572713413647 |
9 | 871758387537567 |
10 | 201330202122151 |
11 | 59171728480973 |
12 | 1a6b7185403607 |
13 | 88454835995cb |
14 | 37a06103cd46b |
15 | 18420d97165a1 |
hex | b71bd72e17a7 |
201330202122151 has 2 divisors, whose sum is σ = 201330202122152. Its totient is φ = 201330202122150.
The previous prime is 201330202122149. The next prime is 201330202122163. The reversal of 201330202122151 is 151221202033102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201330202122151 - 21 = 201330202122149 is a prime.
Together with 201330202122149, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201330202122191) 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, 100665101061075 + 100665101061076.
It is an arithmetic number, because the mean of its divisors is an integer number (100665101061076).
Almost surely, 2201330202122151 is an apocalyptic number.
201330202122151 is a deficient number, since it is larger than the sum of its proper divisors (1).
201330202122151 is an equidigital number, since it uses as much as digits as its factorization.
201330202122151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 201330202122151 its reverse (151221202033102), we get a palindrome (352551404155253).
The spelling of 201330202122151 in words is "two hundred one trillion, three hundred thirty billion, two hundred two million, one hundred twenty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •