Base | Representation |
---|---|
bin | 11011100001011001001111… |
… | …011100111110010100011111 |
3 | 120212120111211011021200110121 |
4 | 123201121033130332110133 |
5 | 111331123210420044411 |
6 | 1105233550153015411 |
7 | 34332001052304133 |
oct | 3341311734762437 |
9 | 525514734250417 |
10 | 121042101331231 |
11 | 35627737705423 |
12 | 116aa92a9b4567 |
13 | 52702b4c10812 |
14 | 21c667cb993c3 |
15 | ded8b20d0571 |
hex | 6e164f73e51f |
121042101331231 has 2 divisors, whose sum is σ = 121042101331232. Its totient is φ = 121042101331230.
The previous prime is 121042101331201. The next prime is 121042101331243. The reversal of 121042101331231 is 132133101240121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121042101331231 - 217 = 121042101200159 is a prime.
It is a super-2 number, since 2×1210421013312312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121042101331196 and 121042101331205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121042101331201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60521050665615 + 60521050665616.
It is an arithmetic number, because the mean of its divisors is an integer number (60521050665616).
Almost surely, 2121042101331231 is an apocalyptic number.
121042101331231 is a deficient number, since it is larger than the sum of its proper divisors (1).
121042101331231 is an equidigital number, since it uses as much as digits as its factorization.
121042101331231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 121042101331231 its reverse (132133101240121), we get a palindrome (253175202571352).
The spelling of 121042101331231 in words is "one hundred twenty-one trillion, forty-two billion, one hundred one million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •