Base | Representation |
---|---|
bin | 1011101110000011011… |
… | …1000000001111110001 |
3 | 201020200210122002122212 |
4 | 2323200313000033301 |
5 | 11244321244322204 |
6 | 232254512341505 |
7 | 20355263232602 |
oct | 2734067001761 |
9 | 636623562585 |
10 | 201341010929 |
11 | 7842a82a5a3 |
12 | 33030844895 |
13 | 15ca90b5b76 |
14 | 9a60239da9 |
15 | 5386065c6e |
hex | 2ee0dc03f1 |
201341010929 has 2 divisors, whose sum is σ = 201341010930. Its totient is φ = 201341010928.
The previous prime is 201341010917. The next prime is 201341010973. The reversal of 201341010929 is 929010143102.
201341010929 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 146199169600 + 55141841329 = 382360^2 + 234823^2 .
It is a cyclic number.
It is not a de Polignac number, because 201341010929 - 212 = 201341006833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201341010895 and 201341010904.
It is not a weakly prime, because it can be changed into another prime (201341010029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100670505464 + 100670505465.
It is an arithmetic number, because the mean of its divisors is an integer number (100670505465).
Almost surely, 2201341010929 is an apocalyptic number.
It is an amenable number.
201341010929 is a deficient number, since it is larger than the sum of its proper divisors (1).
201341010929 is an equidigital number, since it uses as much as digits as its factorization.
201341010929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The spelling of 201341010929 in words is "two hundred one billion, three hundred forty-one million, ten thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •