Base | Representation |
---|---|
bin | 101101110000010010111010… |
… | …011001100011101100001101 |
3 | 222101111111012212000201012221 |
4 | 231300102322121203230031 |
5 | 202333431423330423112 |
6 | 1551552114302455341 |
7 | 60246312106306306 |
oct | 5560227231435415 |
9 | 871444185021187 |
10 | 201230935014157 |
11 | 59133618810444 |
12 | 1a69baa0b94551 |
13 | 8838cc3874699 |
14 | 37998b48297ad |
15 | 183e7299e9e07 |
hex | b704ba663b0d |
201230935014157 has 2 divisors, whose sum is σ = 201230935014158. Its totient is φ = 201230935014156.
The previous prime is 201230935014127. The next prime is 201230935014163. The reversal of 201230935014157 is 751410539032102.
201230935014157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189563716749796 + 11667218264361 = 13768214^2 + 3415731^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201230935014157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201230935014127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100615467507078 + 100615467507079.
It is an arithmetic number, because the mean of its divisors is an integer number (100615467507079).
Almost surely, 2201230935014157 is an apocalyptic number.
It is an amenable number.
201230935014157 is a deficient number, since it is larger than the sum of its proper divisors (1).
201230935014157 is an equidigital number, since it uses as much as digits as its factorization.
201230935014157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 226800, while the sum is 43.
The spelling of 201230935014157 in words is "two hundred one trillion, two hundred thirty billion, nine hundred thirty-five million, fourteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •