Base | Representation |
---|---|
bin | 110111111110010001… |
… | …1010011011100010101 |
3 | 102111021000211011022011 |
4 | 1233330203103130111 |
5 | 3432133003330401 |
6 | 131115241304221 |
7 | 11453461412041 |
oct | 1577443233425 |
9 | 374230734264 |
10 | 120201230101 |
11 | 46a82508297 |
12 | 1b367195071 |
13 | b447ab2534 |
14 | 5b63d69021 |
15 | 31d79a4451 |
hex | 1bfc8d3715 |
120201230101 has 2 divisors, whose sum is σ = 120201230102. Its totient is φ = 120201230100.
The previous prime is 120201230011. The next prime is 120201230117. The reversal of 120201230101 is 101032102021.
Together with previous prime (120201230011) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110058726001 + 10142504100 = 331751^2 + 100710^2 .
It is an emirp because it is prime and its reverse (101032102021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120201230101 - 223 = 120192841493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120201230701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60100615050 + 60100615051.
It is an arithmetic number, because the mean of its divisors is an integer number (60100615051).
Almost surely, 2120201230101 is an apocalyptic number.
It is an amenable number.
120201230101 is a deficient number, since it is larger than the sum of its proper divisors (1).
120201230101 is an equidigital number, since it uses as much as digits as its factorization.
120201230101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 120201230101 its reverse (101032102021), we get a palindrome (221233332122).
The spelling of 120201230101 in words is "one hundred twenty billion, two hundred one million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •