Base | Representation |
---|---|
bin | 111000100010101000… |
… | …1100000010101101101 |
3 | 102121102001121012001222 |
4 | 1301011101200111231 |
5 | 3442132323113401 |
6 | 131440303513125 |
7 | 11525635013252 |
oct | 1610521402555 |
9 | 377361535058 |
10 | 121421301101 |
11 | 47549182731 |
12 | 1b6478b87a5 |
13 | b5b07b3539 |
14 | 5c3c001429 |
15 | 3259b56c1b |
hex | 1c4546056d |
121421301101 has 2 divisors, whose sum is σ = 121421301102. Its totient is φ = 121421301100.
The previous prime is 121421301097. The next prime is 121421301107. The reversal of 121421301101 is 101103124121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95780965225 + 25640335876 = 309485^2 + 160126^2 .
It is a cyclic number.
It is not a de Polignac number, because 121421301101 - 22 = 121421301097 is a prime.
It is a super-2 number, since 2×1214213011012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121421301101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121421301107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60710650550 + 60710650551.
It is an arithmetic number, because the mean of its divisors is an integer number (60710650551).
Almost surely, 2121421301101 is an apocalyptic number.
It is an amenable number.
121421301101 is a deficient number, since it is larger than the sum of its proper divisors (1).
121421301101 is an equidigital number, since it uses as much as digits as its factorization.
121421301101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 121421301101 its reverse (101103124121), we get a palindrome (222524425222).
The spelling of 121421301101 in words is "one hundred twenty-one billion, four hundred twenty-one million, three hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •