Base | Representation |
---|---|
bin | 11011010101011101101111… |
… | …100100000011010011010101 |
3 | 120202200010202212220100022212 |
4 | 123111131233210003103111 |
5 | 111224210233113212041 |
6 | 1103405210205203205 |
7 | 34215526462120220 |
oct | 3325355744032325 |
9 | 522603685810285 |
10 | 120222301304021 |
11 | 35340a9a996184 |
12 | 11597a79560505 |
13 | 5210bb6b34317 |
14 | 2198b0cd245b7 |
15 | dd73d08c38eb |
hex | 6d576f9034d5 |
120222301304021 has 8 divisors (see below), whose sum is σ = 137397071592960. Its totient is φ = 103047569969328.
The previous prime is 120222301303999. The next prime is 120222301304029. The reversal of 120222301304021 is 120403103222021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120222301304021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120222301304029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2795141 + ... + 15756186.
It is an arithmetic number, because the mean of its divisors is an integer number (17174633949120).
Almost surely, 2120222301304021 is an apocalyptic number.
It is an amenable number.
120222301304021 is a deficient number, since it is larger than the sum of its proper divisors (17174770288939).
120222301304021 is an equidigital number, since it uses as much as digits as its factorization.
120222301304021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19477123.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 120222301304021 its reverse (120403103222021), we get a palindrome (240625404526042).
The spelling of 120222301304021 in words is "one hundred twenty trillion, two hundred twenty-two billion, three hundred one million, three hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •