Base | Representation |
---|---|
bin | 110011010101001111… |
… | …0110111010101111001 |
3 | 101112112102110201220001 |
4 | 1212222132313111321 |
5 | 3301230001300441 |
6 | 122350241433001 |
7 | 10651465640506 |
oct | 1465236672571 |
9 | 345472421801 |
10 | 110234400121 |
11 | 4282849941a |
12 | 1944533b761 |
13 | a519c39bc1 |
14 | 549a39c4ad |
15 | 2d02999731 |
hex | 19aa7b7579 |
110234400121 has 8 divisors (see below), whose sum is σ = 114213369600. Its totient is φ = 106281869520.
The previous prime is 110234400097. The next prime is 110234400167. The reversal of 110234400121 is 121004432011.
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 110234400121 - 213 = 110234391929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110234400421) 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, 6601231 + ... + 6617908.
It is an arithmetic number, because the mean of its divisors is an integer number (14276671200).
Almost surely, 2110234400121 is an apocalyptic number.
It is an amenable number.
110234400121 is a deficient number, since it is larger than the sum of its proper divisors (3978969479).
110234400121 is a wasteful number, since it uses less digits than its factorization.
110234400121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13219439.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 110234400121 its reverse (121004432011), we get a palindrome (231238832132).
It can be divided in two parts, 11023 and 4400121, that added together give a palindrome (4411144).
The spelling of 110234400121 in words is "one hundred ten billion, two hundred thirty-four million, four hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •