Base | Representation |
---|---|
bin | 11001011110010000010001… |
… | …100001110101001110011110 |
3 | 112200122222120201121001000202 |
4 | 121132100101201311032132 |
5 | 104141000343040432202 |
6 | 1034133550102223502 |
7 | 32411626212530651 |
oct | 3136202141651636 |
9 | 480588521531022 |
10 | 112030221030302 |
11 | 32772828171383 |
12 | 1069425a424b92 |
13 | 4a68534939283 |
14 | 1d94412333898 |
15 | ce426a929802 |
hex | 65e41187539e |
112030221030302 has 8 divisors (see below), whose sum is σ = 168050695872576. Its totient is φ = 56013322406112.
The previous prime is 112030221030289. The next prime is 112030221030323. The reversal of 112030221030302 is 203030122030211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1120302210303022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 893976203 + ... + 894101510.
It is an arithmetic number, because the mean of its divisors is an integer number (21006336984072).
Almost surely, 2112030221030302 is an apocalyptic number.
112030221030302 is a deficient number, since it is larger than the sum of its proper divisors (56020474842274).
112030221030302 is a wasteful number, since it uses less digits than its factorization.
112030221030302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1788109042.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 112030221030302 its reverse (203030122030211), we get a palindrome (315060343060513).
Subtracting 112030221030302 from its reverse (203030122030211), we obtain a palindrome (90999900999909).
The spelling of 112030221030302 in words is "one hundred twelve trillion, thirty billion, two hundred twenty-one million, thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •