Base | Representation |
---|---|
bin | 111000011100101001… |
… | …0000100010111101111 |
3 | 102120220001001020100200 |
4 | 1300321102010113233 |
5 | 3441224322401340 |
6 | 131404315524543 |
7 | 11520643015452 |
oct | 1607122042757 |
9 | 376801036320 |
10 | 121220122095 |
11 | 47455664996 |
12 | 1b5b0459753 |
13 | b57ac056c7 |
14 | 5c1d3d3499 |
15 | 3247168330 |
hex | 1c394845ef |
121220122095 has 24 divisors (see below), whose sum is σ = 214079314176. Its totient is φ = 63430905408.
The previous prime is 121220122091. The next prime is 121220122099. The reversal of 121220122095 is 590221022121.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (121220122091) and next prime (121220122099).
It is not a de Polignac number, because 121220122095 - 22 = 121220122091 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121220122091) 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 in 23 ways as a sum of consecutive naturals, for example, 25410639 + ... + 25415408.
It is an arithmetic number, because the mean of its divisors is an integer number (8919971424).
Almost surely, 2121220122095 is an apocalyptic number.
121220122095 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
121220122095 is a deficient number, since it is larger than the sum of its proper divisors (92859192081).
121220122095 is a wasteful number, since it uses less digits than its factorization.
121220122095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50826111 (or 50826108 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The spelling of 121220122095 in words is "one hundred twenty-one billion, two hundred twenty million, one hundred twenty-two thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •