Base | Representation |
---|---|
bin | 110011010001111011… |
… | …0010100111010000101 |
3 | 101112020200001121120111 |
4 | 1212203312110322011 |
5 | 3301013004010041 |
6 | 122331224233021 |
7 | 10645644663541 |
oct | 1464366247205 |
9 | 345220047514 |
10 | 110123110021 |
11 | 42780696531 |
12 | 1941400b771 |
13 | a4ccb72582 |
14 | 54896aca21 |
15 | 2ce7d14981 |
hex | 19a3d94e85 |
110123110021 has 8 divisors (see below), whose sum is σ = 115924042080. Its totient is φ = 104322675888.
The previous prime is 110123110007. The next prime is 110123110063. The reversal of 110123110021 is 120011321011.
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 110123110021 - 223 = 110114721413 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110123109983 and 110123110010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110123110921) 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, 382470 + ... + 605416.
It is an arithmetic number, because the mean of its divisors is an integer number (14490505260).
Almost surely, 2110123110021 is an apocalyptic number.
It is an amenable number.
110123110021 is a deficient number, since it is larger than the sum of its proper divisors (5800932059).
110123110021 is a wasteful number, since it uses less digits than its factorization.
110123110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248963.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110123110021 its reverse (120011321011), we get a palindrome (230134431032).
The spelling of 110123110021 in words is "one hundred ten billion, one hundred twenty-three million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •