Base | Representation |
---|---|
bin | 11001011110000111110011… |
… | …010000011010100000000000 |
3 | 112200122010002200110001022221 |
4 | 121132013303100122200000 |
5 | 104140323230020311222 |
6 | 1034125443224340424 |
7 | 32411154601416115 |
oct | 3136076320324000 |
9 | 480563080401287 |
10 | 112021123213312 |
11 | 3276998973a865 |
12 | 1069253b614714 |
13 | 4a67714b2b001 |
14 | 1d93bcbd3890c |
15 | ce3dd6d7a0c7 |
hex | 65e1f341a800 |
112021123213312 has 48 divisors (see below), whose sum is σ = 224352946801620. Its totient is φ = 55919189753856.
The previous prime is 112021123213289. The next prime is 112021123213313. The reversal of 112021123213312 is 213312321120211.
It can be written as a sum of positive squares in 2 ways, for example, as 107935809094656 + 4085314118656 = 10389216^2 + 2021216^2 .
It is not an unprimeable number, because it can be changed into a prime (112021123213313) 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 3 ways as a sum of consecutive naturals, for example, 43359433 + ... + 45870280.
Almost surely, 2112021123213312 is an apocalyptic number.
It is an amenable number.
112021123213312 is an abundant number, since it is smaller than the sum of its proper divisors (112331823588308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112021123213312 is an frugal number, since it uses more digits than its factorization.
112021123213312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89230348 (or 89230328 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 112021123213312 its reverse (213312321120211), we get a palindrome (325333444333523).
The spelling of 112021123213312 in words is "one hundred twelve trillion, twenty-one billion, one hundred twenty-three million, two hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •