Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …110110010110110000001011 |
3 | 222100201120121220210201220101 |
4 | 231231013030312112300023 |
5 | 202321340442003034011 |
6 | 1551303421434310231 |
7 | 60224436506612026 |
oct | 5555071466266013 |
9 | 870646556721811 |
10 | 201012201221131 |
11 | 59059883237273 |
12 | 1a665617588377 |
13 | 88214a52b32a1 |
14 | 378d0846a81bd |
15 | 1838bc6a722c1 |
hex | b6d1ccd96c0b |
201012201221131 has 2 divisors, whose sum is σ = 201012201221132. Its totient is φ = 201012201221130.
The previous prime is 201012201221021. The next prime is 201012201221159. The reversal of 201012201221131 is 131122102210102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201012201221131 - 29 = 201012201220619 is a prime.
It is a super-2 number, since 2×2010122012211312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201012201221099 and 201012201221108.
It is not a weakly prime, because it can be changed into another prime (201012201221731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100506100610565 + 100506100610566.
It is an arithmetic number, because the mean of its divisors is an integer number (100506100610566).
Almost surely, 2201012201221131 is an apocalyptic number.
201012201221131 is a deficient number, since it is larger than the sum of its proper divisors (1).
201012201221131 is an equidigital number, since it uses as much as digits as its factorization.
201012201221131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 201012201221131 its reverse (131122102210102), we get a palindrome (332134303431233).
The spelling of 201012201221131 in words is "two hundred one trillion, twelve billion, two hundred one million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •