Base | Representation |
---|---|
bin | 101101110100010010010000… |
… | …101010100101111100111101 |
3 | 222102110200220202210111012021 |
4 | 231310102100222211330331 |
5 | 202402424432330244431 |
6 | 1552322100523040141 |
7 | 60305156353460512 |
oct | 5564222052457475 |
9 | 872420822714167 |
10 | 201505112743741 |
11 | 59229924a09794 |
12 | 1a72505a670051 |
13 | 8858b099ba231 |
14 | 37a8c842dd309 |
15 | 1846925210b11 |
hex | b74490aa5f3d |
201505112743741 has 2 divisors, whose sum is σ = 201505112743742. Its totient is φ = 201505112743740.
The previous prime is 201505112743709. The next prime is 201505112743757. The reversal of 201505112743741 is 147347211505102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150171054624900 + 51334058118841 = 12254430^2 + 7164779^2 .
It is a cyclic number.
It is not a de Polignac number, because 201505112743741 - 25 = 201505112743709 is a prime.
It is a super-2 number, since 2×2015051127437412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201505112740741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100752556371870 + 100752556371871.
It is an arithmetic number, because the mean of its divisors is an integer number (100752556371871).
Almost surely, 2201505112743741 is an apocalyptic number.
It is an amenable number.
201505112743741 is a deficient number, since it is larger than the sum of its proper divisors (1).
201505112743741 is an equidigital number, since it uses as much as digits as its factorization.
201505112743741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 235200, while the sum is 43.
The spelling of 201505112743741 in words is "two hundred one trillion, five hundred five billion, one hundred twelve million, seven hundred forty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.469 sec. • engine limits •