Base | Representation |
---|---|
bin | 111110111100011… |
… | …0110000110010100 |
3 | 12110012012102221100 |
4 | 1331320312012110 |
5 | 13311141204102 |
6 | 545324350100 |
7 | 103224105552 |
oct | 17570660624 |
9 | 5405172840 |
10 | 2112053652 |
11 | 994221195 |
12 | 4ab3a5330 |
13 | 27874b3b7 |
14 | 160706bd2 |
15 | c5648a1c |
hex | 7de36194 |
2112053652 has 18 divisors (see below), whose sum is σ = 5338802378. Its totient is φ = 704017872.
The previous prime is 2112053641. The next prime is 2112053687. The reversal of 2112053652 is 2563502112.
It is a happy number.
2112053652 is a `hidden beast` number, since 2 + 1 + 1 + 2 + 0 + 5 + 3 + 652 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1205200656 + 906852996 = 34716^2 + 30114^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a congruent number.
It is an unprimeable number.
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 in 5 ways as a sum of consecutive naturals, for example, 29334043 + ... + 29334114.
Almost surely, 22112053652 is an apocalyptic number.
It is an amenable number.
2112053652 is an abundant number, since it is smaller than the sum of its proper divisors (3226748726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112053652 is a wasteful number, since it uses less digits than its factorization.
2112053652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58668167 (or 58668162 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 2112053652 is about 45957.0848944970. The cubic root of 2112053652 is about 1283.0245962139.
Adding to 2112053652 its reverse (2563502112), we get a palindrome (4675555764).
The spelling of 2112053652 in words is "two billion, one hundred twelve million, fifty-three thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •