Base | Representation |
---|---|
bin | 110111111100001111… |
… | …1110111101011101101 |
3 | 102111002021211221111022 |
4 | 1233320133313223231 |
5 | 3432013101033401 |
6 | 131104411503525 |
7 | 11452004350055 |
oct | 1577037675355 |
9 | 374067757438 |
10 | 120133221101 |
11 | 46a48087103 |
12 | 1b348457ba5 |
13 | b43699001a |
14 | 5b58d04565 |
15 | 31d1a1d71b |
hex | 1bf87f7aed |
120133221101 has 4 divisors (see below), whose sum is σ = 120182317632. Its totient is φ = 120084124572.
The previous prime is 120133221041. The next prime is 120133221119. The reversal of 120133221101 is 101122331021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120133221101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120133221101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120133221301) 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, 24544595 + ... + 24549488.
It is an arithmetic number, because the mean of its divisors is an integer number (30045579408).
Almost surely, 2120133221101 is an apocalyptic number.
It is an amenable number.
120133221101 is a deficient number, since it is larger than the sum of its proper divisors (49096531).
120133221101 is an equidigital number, since it uses as much as digits as its factorization.
120133221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49096530.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 120133221101 its reverse (101122331021), we get a palindrome (221255552122).
The spelling of 120133221101 in words is "one hundred twenty billion, one hundred thirty-three million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •