Base | Representation |
---|---|
bin | 110111111001010001… |
… | …0011110110010000001 |
3 | 102110211022201111021120 |
4 | 1233302202132302001 |
5 | 3431312002222431 |
6 | 131050440542453 |
7 | 11446351503363 |
oct | 1576242366201 |
9 | 373738644246 |
10 | 120033242241 |
11 | 469a66aa550 |
12 | 1b31aa81a29 |
13 | b41c056033 |
14 | 5b4991ad33 |
15 | 31c7d70196 |
hex | 1bf289ec81 |
120033242241 has 8 divisors (see below), whose sum is σ = 174593806944. Its totient is φ = 72747419520.
The previous prime is 120033242239. The next prime is 120033242267. The reversal of 120033242241 is 142242330021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120033242241 - 21 = 120033242239 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120033242291) 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 7 ways as a sum of consecutive naturals, for example, 1818685456 + ... + 1818685521.
It is an arithmetic number, because the mean of its divisors is an integer number (21824225868).
Almost surely, 2120033242241 is an apocalyptic number.
120033242241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120033242241 is a deficient number, since it is larger than the sum of its proper divisors (54560564703).
120033242241 is a wasteful number, since it uses less digits than its factorization.
120033242241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3637370991.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 120033242241 its reverse (142242330021), we get a palindrome (262275572262).
The spelling of 120033242241 in words is "one hundred twenty billion, thirty-three million, two hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •