Base | Representation |
---|---|
bin | 11011010010010001100000… |
… | …010000001101011010001011 |
3 | 120201220011201110220022221021 |
4 | 123102101200100031122023 |
5 | 111212112121241042303 |
6 | 1103120341225053311 |
7 | 34163634144211336 |
oct | 3322214020153213 |
9 | 521804643808837 |
10 | 120003001112203 |
11 | 35266a94724230 |
12 | 11561476327237 |
13 | 51c6308110501 |
14 | 218c26788561d |
15 | dd1847d68ebd |
hex | 6d246040d68b |
120003001112203 has 8 divisors (see below), whose sum is σ = 132183358684416. Its totient is φ = 108034475845800.
The previous prime is 120003001112129. The next prime is 120003001112209. The reversal of 120003001112203 is 302211100300021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120003001112203 - 221 = 120002999015051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120003001112209) 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, 52958075263 + ... + 52958077528.
It is an arithmetic number, because the mean of its divisors is an integer number (16522919835552).
Almost surely, 2120003001112203 is an apocalyptic number.
120003001112203 is a deficient number, since it is larger than the sum of its proper divisors (12180357572213).
120003001112203 is a wasteful number, since it uses less digits than its factorization.
120003001112203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105916152905.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 120003001112203 its reverse (302211100300021), we get a palindrome (422214101412224).
The spelling of 120003001112203 in words is "one hundred twenty trillion, three billion, one million, one hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •