Base | Representation |
---|---|
bin | 110100001010110000… |
… | …1011000101101110111 |
3 | 101201011120122000001210 |
4 | 1220111201120231313 |
5 | 3313414214120343 |
6 | 123244352252503 |
7 | 11044133120412 |
oct | 1502541305567 |
9 | 351146560053 |
10 | 112030223223 |
11 | 4356a15a946 |
12 | 19866841133 |
13 | a744cc6a19 |
14 | 55caaa8b79 |
15 | 2daa47a333 |
hex | 1a15858b77 |
112030223223 has 8 divisors (see below), whose sum is σ = 149375179648. Its totient is φ = 74686041144.
The previous prime is 112030223219. The next prime is 112030223243. The reversal of 112030223223 is 322322030211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112030223223 - 22 = 112030223219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112030223223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112030223243) 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 7 ways as a sum of consecutive naturals, for example, 443790 + ... + 648852.
It is an arithmetic number, because the mean of its divisors is an integer number (18671897456).
Almost surely, 2112030223223 is an apocalyptic number.
112030223223 is a deficient number, since it is larger than the sum of its proper divisors (37344956425).
112030223223 is a wasteful number, since it uses less digits than its factorization.
112030223223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387173.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 112030223223 its reverse (322322030211), we get a palindrome (434352253434).
The spelling of 112030223223 in words is "one hundred twelve billion, thirty million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.553 sec. • engine limits •