Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …101111000011000101110011 |
3 | 120220012112022001101102111121 |
4 | 123203333001233003011303 |
5 | 111342032242224043443 |
6 | 1105451430102323111 |
7 | 34350602246655121 |
oct | 3343770157030563 |
9 | 526175261342447 |
10 | 121220112331123 |
11 | 35696185233363 |
12 | 1171932a429497 |
13 | 528401375c710 |
14 | 21d1128760911 |
15 | e0332ed9a4ed |
hex | 6e3fc1bc3173 |
121220112331123 has 24 divisors (see below), whose sum is σ = 135497355925568. Its totient is φ = 107800613883648.
The previous prime is 121220112331103. The next prime is 121220112331163. The reversal of 121220112331123 is 321133211022121.
It is not a de Polignac number, because 121220112331123 - 213 = 121220112322931 is a prime.
It is a super-2 number, since 2×1212201123311232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121220112331103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7134411 + ... + 17127172.
Almost surely, 2121220112331123 is an apocalyptic number.
121220112331123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
121220112331123 is a deficient number, since it is larger than the sum of its proper divisors (14277243594445).
121220112331123 is a wasteful number, since it uses less digits than its factorization.
121220112331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24262111 (or 24262082 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 121220112331123 its reverse (321133211022121), we get a palindrome (442353323353244).
The spelling of 121220112331123 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred twelve million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •