Base | Representation |
---|---|
bin | 111000010110011110… |
… | …0000010111000001110 |
3 | 102120100121100110202000 |
4 | 1300230330002320032 |
5 | 3440313313202342 |
6 | 131332001013130 |
7 | 11512546500651 |
oct | 1605474027016 |
9 | 376317313660 |
10 | 121013022222 |
11 | 47359772774 |
12 | 1b5530241a6 |
13 | b5470338c1 |
14 | 5bddac3898 |
15 | 3233daa44c |
hex | 1c2cf02e0e |
121013022222 has 32 divisors (see below), whose sum is σ = 268961952000. Its totient is φ = 40331055384.
The previous prime is 121013022211. The next prime is 121013022223. The reversal of 121013022222 is 222220310121.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 121013022195 and 121013022204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121013022223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153993 + ... + 515499.
It is an arithmetic number, because the mean of its divisors is an integer number (8405061000).
Almost surely, 2121013022222 is an apocalyptic number.
121013022222 is an abundant number, since it is smaller than the sum of its proper divisors (147948929778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121013022222 is a wasteful number, since it uses less digits than its factorization.
121013022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367717 (or 367711 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 121013022222 its reverse (222220310121), we get a palindrome (343233332343).
The spelling of 121013022222 in words is "one hundred twenty-one billion, thirteen million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •