Base | Representation |
---|---|
bin | 111110111100110… |
… | …0001011001101110 |
3 | 12110012112110020121 |
4 | 1331321201121232 |
5 | 13311212343042 |
6 | 545332235154 |
7 | 103225444636 |
oct | 17571413156 |
9 | 5405473217 |
10 | 2112231022 |
11 | 994332480 |
12 | 4ab46baba |
13 | 2787b1055 |
14 | 1607516c6 |
15 | c5681367 |
hex | 7de6166e |
2112231022 has 8 divisors (see below), whose sum is σ = 3456378072. Its totient is φ = 960105000.
The previous prime is 2112231001. The next prime is 2112231029. The reversal of 2112231022 is 2201322112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2112230987 and 2112231005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112231029) 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, 48005229 + ... + 48005272.
It is an arithmetic number, because the mean of its divisors is an integer number (432047259).
Almost surely, 22112231022 is an apocalyptic number.
2112231022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2112231022 is a deficient number, since it is larger than the sum of its proper divisors (1344147050).
2112231022 is a wasteful number, since it uses less digits than its factorization.
2112231022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96010514.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 2112231022 is about 45959.0145890880. The cubic root of 2112231022 is about 1283.0605112899.
Adding to 2112231022 its reverse (2201322112), we get a palindrome (4313553134).
The spelling of 2112231022 in words is "two billion, one hundred twelve million, two hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •