Base | Representation |
---|---|
bin | 110100001010011111… |
… | …0110010001100010100 |
3 | 101201010221120011102021 |
4 | 1220110332302030110 |
5 | 3313404403340112 |
6 | 123243430022524 |
7 | 11043663041302 |
oct | 1502476621424 |
9 | 351127504367 |
10 | 112021152532 |
11 | 43565024a03 |
12 | 198637a7a44 |
13 | a74316c153 |
14 | 55c97c7272 |
15 | 2da9787907 |
hex | 1a14fb2314 |
112021152532 has 6 divisors (see below), whose sum is σ = 196037016938. Its totient is φ = 56010576264.
The previous prime is 112021152521. The next prime is 112021152533. The reversal of 112021152532 is 235251120211.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 66721989636 + 45299162896 = 258306^2 + 212836^2 .
It is a super-2 number, since 2×1120211525322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112021152497 and 112021152506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112021152533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14002644063 + ... + 14002644070.
Almost surely, 2112021152532 is an apocalyptic number.
It is an amenable number.
112021152532 is a deficient number, since it is larger than the sum of its proper divisors (84015864406).
112021152532 is a wasteful number, since it uses less digits than its factorization.
112021152532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28005288137 (or 28005288135 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 112021152532 its reverse (235251120211), we get a palindrome (347272272743).
The spelling of 112021152532 in words is "one hundred twelve billion, twenty-one million, one hundred fifty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •