Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …101010110100000100100111 |
3 | 120220012112021222022000202002 |
4 | 123203333001222310010213 |
5 | 111342032241433033111 |
6 | 1105451430022435515 |
7 | 34350602234352524 |
oct | 3343770152640447 |
9 | 526175258260662 |
10 | 121220111221031 |
11 | 35696184645329 |
12 | 11719329b92b9b |
13 | 5284013461364 |
14 | 21d112855214b |
15 | e0332ec2b63b |
hex | 6e3fc1ab4127 |
121220111221031 has 2 divisors, whose sum is σ = 121220111221032. Its totient is φ = 121220111221030.
The previous prime is 121220111221007. The next prime is 121220111221073. The reversal of 121220111221031 is 130122111022121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121220111221031 - 222 = 121220107026727 is a prime.
It is a super-2 number, since 2×1212201112210312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121220111220994 and 121220111221012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121220111221831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60610055610515 + 60610055610516.
It is an arithmetic number, because the mean of its divisors is an integer number (60610055610516).
Almost surely, 2121220111221031 is an apocalyptic number.
121220111221031 is a deficient number, since it is larger than the sum of its proper divisors (1).
121220111221031 is an equidigital number, since it uses as much as digits as its factorization.
121220111221031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 121220111221031 its reverse (130122111022121), we get a palindrome (251342222243152).
The spelling of 121220111221031 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred eleven million, two hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •