Base | Representation |
---|---|
bin | 11001011110010001000111… |
… | …010010100101001010100110 |
3 | 112200200001220120210221121202 |
4 | 121132101013102211022212 |
5 | 104141004214442031042 |
6 | 1034134215402442502 |
7 | 32411660444261060 |
oct | 3136210722451246 |
9 | 480601816727552 |
10 | 112031123002022 |
11 | 32773150320054 |
12 | 10694470503432 |
13 | 4a68649773253 |
14 | 1d9449a044730 |
15 | ce42bebe5632 |
hex | 65e4474a52a6 |
112031123002022 has 8 divisors (see below), whose sum is σ = 192053353717776. Its totient is φ = 48013338429432.
The previous prime is 112031123001989. The next prime is 112031123002027. The reversal of 112031123002022 is 220200321130211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1120311230020222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112031123001985 and 112031123002003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112031123002027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4001111535773 + ... + 4001111535800.
It is an arithmetic number, because the mean of its divisors is an integer number (24006669214722).
Almost surely, 2112031123002022 is an apocalyptic number.
112031123002022 is a deficient number, since it is larger than the sum of its proper divisors (80022230715754).
112031123002022 is an equidigital number, since it uses as much as digits as its factorization.
112031123002022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8002223071582.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112031123002022 its reverse (220200321130211), we get a palindrome (332231444132233).
The spelling of 112031123002022 in words is "one hundred twelve trillion, thirty-one billion, one hundred twenty-three million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •