Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1101001000010001101 |
3 | 100200012212202122002021 |
4 | 1132100003221002031 |
5 | 3124224441341141 |
6 | 114254031130141 |
7 | 10211600224141 |
oct | 1362003510215 |
9 | 320185678067 |
10 | 101201121421 |
11 | 39a12438434 |
12 | 17744073951 |
13 | 970a60748a |
14 | 4c807a3221 |
15 | 29748e76d1 |
hex | 17900e908d |
101201121421 has 2 divisors, whose sum is σ = 101201121422. Its totient is φ = 101201121420.
The previous prime is 101201121407. The next prime is 101201121443. The reversal of 101201121421 is 124121102101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64815558921 + 36385562500 = 254589^2 + 190750^2 .
It is a cyclic number.
It is not a de Polignac number, because 101201121421 - 27 = 101201121293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101201121395 and 101201121404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101201121481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600560710 + 50600560711.
It is an arithmetic number, because the mean of its divisors is an integer number (50600560711).
Almost surely, 2101201121421 is an apocalyptic number.
It is an amenable number.
101201121421 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201121421 is an equidigital number, since it uses as much as digits as its factorization.
101201121421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101201121421 its reverse (124121102101), we get a palindrome (225322223522).
The spelling of 101201121421 in words is "one hundred one billion, two hundred one million, one hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •