Base | Representation |
---|---|
bin | 110011010111110111… |
… | …0101001000011111101 |
3 | 101112202120002201020010 |
4 | 1212233232221003331 |
5 | 3301420020001023 |
6 | 122403104213433 |
7 | 10653615054216 |
oct | 1465756510375 |
9 | 345676081203 |
10 | 110322422013 |
11 | 42873149591 |
12 | 1946a90a279 |
13 | a53224866b |
14 | 54a7d5240d |
15 | 2d0a585093 |
hex | 19afba90fd |
110322422013 has 8 divisors (see below), whose sum is σ = 147106562848. Its totient is φ = 73543281264.
The previous prime is 110322422009. The next prime is 110322422027. The reversal of 110322422013 is 310224223011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110322422013 - 22 = 110322422009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110322422053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1198231 + ... + 1287012.
It is an arithmetic number, because the mean of its divisors is an integer number (18388320356).
Almost surely, 2110322422013 is an apocalyptic number.
It is an amenable number.
110322422013 is a deficient number, since it is larger than the sum of its proper divisors (36784140835).
110322422013 is a wasteful number, since it uses less digits than its factorization.
110322422013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2500043.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 110322422013 its reverse (310224223011), we get a palindrome (420546645024).
The spelling of 110322422013 in words is "one hundred ten billion, three hundred twenty-two million, four hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •