Base | Representation |
---|---|
bin | 110100001010100011… |
… | …0010011000110010001 |
3 | 101201011002021020110102 |
4 | 1220111012103012101 |
5 | 3313410404403241 |
6 | 123243540142145 |
7 | 11044015554155 |
oct | 1502506230621 |
9 | 351132236412 |
10 | 112023122321 |
11 | 4356614a930 |
12 | 19864397955 |
13 | a7436ab8c6 |
14 | 55c9b7b065 |
15 | 2da9a2639b |
hex | 1a15193191 |
112023122321 has 8 divisors (see below), whose sum is σ = 122889765600. Its totient is φ = 101270266240.
The previous prime is 112023122311. The next prime is 112023122363. The reversal of 112023122321 is 123221320211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-112023122321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112023122293 and 112023122302.
It is not an unprimeable number, because it can be changed into a prime (112023122311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28444736 + ... + 28448673.
It is an arithmetic number, because the mean of its divisors is an integer number (15361220700).
Almost surely, 2112023122321 is an apocalyptic number.
112023122321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112023122321 is a deficient number, since it is larger than the sum of its proper divisors (10866643279).
112023122321 is a wasteful number, since it uses less digits than its factorization.
112023122321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56893599.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112023122321 its reverse (123221320211), we get a palindrome (235244442532).
The spelling of 112023122321 in words is "one hundred twelve billion, twenty-three million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •