Base | Representation |
---|---|
bin | 110011001110111100… |
… | …0111011111110001101 |
3 | 101111222200221011011120 |
4 | 1212131320323332031 |
5 | 3300311410143041 |
6 | 122313253311153 |
7 | 10643322116556 |
oct | 1463570737615 |
9 | 344880834146 |
10 | 110023131021 |
11 | 4272a209861 |
12 | 193a66354b9 |
13 | a4b52384bb |
14 | 547a2c532d |
15 | 2cde166366 |
hex | 199de3bf8d |
110023131021 has 4 divisors (see below), whose sum is σ = 146697508032. Its totient is φ = 73348754012.
The previous prime is 110023131013. The next prime is 110023131133. The reversal of 110023131021 is 120131320011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 120131320011 = 3 ⋅40043773337.
It is a cyclic number.
It is not a de Polignac number, because 110023131021 - 23 = 110023131013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110023131221) 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, 18337188501 + ... + 18337188506.
It is an arithmetic number, because the mean of its divisors is an integer number (36674377008).
Almost surely, 2110023131021 is an apocalyptic number.
It is an amenable number.
110023131021 is a deficient number, since it is larger than the sum of its proper divisors (36674377011).
110023131021 is an equidigital number, since it uses as much as digits as its factorization.
110023131021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36674377010.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 110023131021 its reverse (120131320011), we get a palindrome (230154451032).
The spelling of 110023131021 in words is "one hundred ten billion, twenty-three million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •