Base | Representation |
---|---|
bin | 10000010100001110110… |
… | …000101100011111010101 |
3 | 10222012002201210100012212 |
4 | 100110032300230133111 |
5 | 121332241413013141 |
6 | 2215030550123205 |
7 | 144002140455005 |
oct | 20241660543725 |
9 | 3865081710185 |
10 | 1121234110421 |
11 | 3a2570474487 |
12 | 161377050505 |
13 | 8196905b259 |
14 | 3c3a763c005 |
15 | 1e274c442eb |
hex | 1050ec2c7d5 |
1121234110421 has 2 divisors, whose sum is σ = 1121234110422. Its totient is φ = 1121234110420.
The previous prime is 1121234110397. The next prime is 1121234110429. The reversal of 1121234110421 is 1240114321211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 914108088100 + 207126022321 = 956090^2 + 455111^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121234110421 - 230 = 1120160368597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121234110429) 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, 560617055210 + 560617055211.
It is an arithmetic number, because the mean of its divisors is an integer number (560617055211).
Almost surely, 21121234110421 is an apocalyptic number.
It is an amenable number.
1121234110421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121234110421 is an equidigital number, since it uses as much as digits as its factorization.
1121234110421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1121234110421 its reverse (1240114321211), we get a palindrome (2361348431632).
The spelling of 1121234110421 in words is "one trillion, one hundred twenty-one billion, two hundred thirty-four million, one hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •