Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1010110101101100111 |
3 | 102120220011122021120110 |
4 | 1300321121112231213 |
5 | 3441230320012411 |
6 | 131404424504103 |
7 | 11520665162406 |
oct | 1607131265547 |
9 | 376804567513 |
10 | 121222032231 |
11 | 4745674a013 |
12 | 1b5b101b033 |
13 | b57b423c71 |
14 | 5c1d76d63d |
15 | 32473e42a6 |
hex | 1c39656b67 |
121222032231 has 4 divisors (see below), whose sum is σ = 161629376312. Its totient is φ = 80814688152.
The previous prime is 121222032229. The next prime is 121222032271. The reversal of 121222032231 is 132230222121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 121222032231 - 21 = 121222032229 is a prime.
It is a super-2 number, since 2×1212220322312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121222032198 and 121222032207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121222032271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20203672036 + ... + 20203672041.
It is an arithmetic number, because the mean of its divisors is an integer number (40407344078).
Almost surely, 2121222032231 is an apocalyptic number.
121222032231 is a deficient number, since it is larger than the sum of its proper divisors (40407344081).
121222032231 is an equidigital number, since it uses as much as digits as its factorization.
121222032231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40407344080.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 121222032231 its reverse (132230222121), we get a palindrome (253452254352).
The spelling of 121222032231 in words is "one hundred twenty-one billion, two hundred twenty-two million, thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •