Base | Representation |
---|---|
bin | 110111111110111001… |
… | …1101011101101001001 |
3 | 102111022111110200010212 |
4 | 1233331303223231021 |
5 | 3432203402113001 |
6 | 131121313050505 |
7 | 11454135461165 |
oct | 1577563535511 |
9 | 374274420125 |
10 | 120222301001 |
11 | 46a9339a160 |
12 | 1b372256a35 |
13 | b44c27c21a |
14 | 5b66a91ca5 |
15 | 31d97677bb |
hex | 1bfdcebb49 |
120222301001 has 4 divisors (see below), whose sum is σ = 131151601104. Its totient is φ = 109293000900.
The previous prime is 120222300997. The next prime is 120222301057. The reversal of 120222301001 is 100103222021.
It is a happy number.
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 not a de Polignac number, because 120222301001 - 22 = 120222300997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120222303001) 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, 5464650035 + ... + 5464650056.
It is an arithmetic number, because the mean of its divisors is an integer number (32787900276).
Almost surely, 2120222301001 is an apocalyptic number.
120222301001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120222301001 is a deficient number, since it is larger than the sum of its proper divisors (10929300103).
120222301001 is a wasteful number, since it uses less digits than its factorization.
120222301001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10929300102.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 120222301001 its reverse (100103222021), we get a palindrome (220325523022).
The spelling of 120222301001 in words is "one hundred twenty billion, two hundred twenty-two million, three hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •