Base | Representation |
---|---|
bin | 11001011110010000010001… |
… | …011110010010011000001101 |
3 | 112200122222120122211211110002 |
4 | 121132100101132102120031 |
5 | 104141000342321214013 |
6 | 1034133550030254045 |
7 | 32411626201611005 |
oct | 3136202136223015 |
9 | 480588518754402 |
10 | 112030220101133 |
11 | 32772827697274 |
12 | 1069425a057325 |
13 | 4a685346a2379 |
14 | 1d94412171005 |
15 | ce426a7e4358 |
hex | 65e41179260d |
112030220101133 has 8 divisors (see below), whose sum is σ = 112069382668416. Its totient is φ = 111991058838400.
The previous prime is 112030220101099. The next prime is 112030220101139. The reversal of 112030220101133 is 331101022030211.
It is a happy number.
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 112030220101133 - 210 = 112030220100109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112030220101139) 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, 190968860 + ... + 191554602.
It is an arithmetic number, because the mean of its divisors is an integer number (14008672833552).
Almost surely, 2112030220101133 is an apocalyptic number.
It is an amenable number.
112030220101133 is a deficient number, since it is larger than the sum of its proper divisors (39162567283).
112030220101133 is an equidigital number, since it uses as much as digits as its factorization.
112030220101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652275.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 112030220101133 its reverse (331101022030211), we get a palindrome (443131242131344).
The spelling of 112030220101133 in words is "one hundred twelve trillion, thirty billion, two hundred twenty million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •