Base | Representation |
---|---|
bin | 110011010001111001… |
… | …0011110010100110111 |
3 | 101112020121011022010011 |
4 | 1212203302132110313 |
5 | 3301012224200043 |
6 | 122331150441051 |
7 | 10645633256125 |
oct | 1464362362467 |
9 | 345217138104 |
10 | 110122100023 |
11 | 42780066721 |
12 | 19413803187 |
13 | a4cc8aa940 |
14 | 54894c8915 |
15 | 2ce7bb559d |
hex | 19a3c9e537 |
110122100023 has 8 divisors (see below), whose sum is σ = 118689386816. Its totient is φ = 101568578400.
The previous prime is 110122100009. The next prime is 110122100041. The reversal of 110122100023 is 320001221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110122100023 - 213 = 110122091831 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 110122099976 and 110122100012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110122100083) 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, 3424668 + ... + 3456673.
It is an arithmetic number, because the mean of its divisors is an integer number (14836173352).
Almost surely, 2110122100023 is an apocalyptic number.
110122100023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
110122100023 is a deficient number, since it is larger than the sum of its proper divisors (8567286793).
110122100023 is a wasteful number, since it uses less digits than its factorization.
110122100023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6882585.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110122100023 its reverse (320001221011), we get a palindrome (430123321034).
The spelling of 110122100023 in words is "one hundred ten billion, one hundred twenty-two million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •