Base | Representation |
---|---|
bin | 11011010011111110101011… |
… | …000111000110000111000011 |
3 | 120202022101021202001021102110 |
4 | 123103332223013012013003 |
5 | 111221022203102144303 |
6 | 1103250245012550403 |
7 | 34205254026014016 |
oct | 3323765307060703 |
9 | 522271252037373 |
10 | 120120221131203 |
11 | 35301777334497 |
12 | 1158012b022403 |
13 | 52043993895b7 |
14 | 2193bc78d937d |
15 | dd4908c3b703 |
hex | 6d3fab1c61c3 |
120120221131203 has 8 divisors (see below), whose sum is σ = 169581488655888. Its totient is φ = 75369550513664.
The previous prime is 120120221131201. The next prime is 120120221131297. The reversal of 120120221131203 is 302131122021021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120120221131203 - 21 = 120120221131201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120120221131203.
It is not an unprimeable number, because it can be changed into a prime (120120221131201) 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, 1177649226726 + ... + 1177649226827.
It is an arithmetic number, because the mean of its divisors is an integer number (21197686081986).
Almost surely, 2120120221131203 is an apocalyptic number.
120120221131203 is a deficient number, since it is larger than the sum of its proper divisors (49461267524685).
120120221131203 is a wasteful number, since it uses less digits than its factorization.
120120221131203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2355298453573.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 120120221131203 its reverse (302131122021021), we get a palindrome (422251343152224).
The spelling of 120120221131203 in words is "one hundred twenty trillion, one hundred twenty billion, two hundred twenty-one million, one hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •