Base | Representation |
---|---|
bin | 1011101101000000101… |
… | …1111101100100111111 |
3 | 201012222022021220220112 |
4 | 2323100023331210333 |
5 | 11243233142323401 |
6 | 232211041140235 |
7 | 20345325533543 |
oct | 2732013754477 |
9 | 635868256815 |
10 | 201061292351 |
11 | 782a6948917 |
12 | 32b7302a67b |
13 | 15c6316960a |
14 | 9a35025a23 |
15 | 536b7113bb |
hex | 2ed02fd93f |
201061292351 has 2 divisors, whose sum is σ = 201061292352. Its totient is φ = 201061292350.
The previous prime is 201061292303. The next prime is 201061292353. The reversal of 201061292351 is 153292160102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201061292351 - 214 = 201061275967 is a prime.
It is a super-2 number, since 2×2010612923512 (a number of 23 digits) contains 22 as substring.
Together with 201061292353, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201061292353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100530646175 + 100530646176.
It is an arithmetic number, because the mean of its divisors is an integer number (100530646176).
Almost surely, 2201061292351 is an apocalyptic number.
201061292351 is a deficient number, since it is larger than the sum of its proper divisors (1).
201061292351 is an equidigital number, since it uses as much as digits as its factorization.
201061292351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 201061292351 in words is "two hundred one billion, sixty-one million, two hundred ninety-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •