Base | Representation |
---|---|
bin | 11001010000101101111101… |
… | …010011001010101011100000 |
3 | 112120101001120111112202002222 |
4 | 121100231331103022223200 |
5 | 104030230320413101422 |
6 | 1032142351204130212 |
7 | 32254466044603256 |
oct | 3120557523125340 |
9 | 476331514482088 |
10 | 111100021222112 |
11 | 3244428867671a |
12 | 10563b18396968 |
13 | 49cb8c159a1a0 |
14 | 1d613ac1705d6 |
15 | cc9e76ea6842 |
hex | 650b7d4caae0 |
111100021222112 has 24 divisors (see below), whose sum is σ = 235553410380456. Its totient is φ = 51276932871552.
The previous prime is 111100021222111. The next prime is 111100021222123. The reversal of 111100021222112 is 211222120001111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100021222111) by changing a digit.
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, 133533678938 + ... + 133533679769.
It is an arithmetic number, because the mean of its divisors is an integer number (9814725432519).
Almost surely, 2111100021222112 is an apocalyptic number.
It is an amenable number.
111100021222112 is an abundant number, since it is smaller than the sum of its proper divisors (124453389158344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111100021222112 is a wasteful number, since it uses less digits than its factorization.
111100021222112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267067358730 (or 267067358722 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111100021222112 its reverse (211222120001111), we get a palindrome (322322141223223).
The spelling of 111100021222112 in words is "one hundred eleven trillion, one hundred billion, twenty-one million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •