Base | Representation |
---|---|
bin | 110011101000111101… |
… | …1111010010111101001 |
3 | 101121020120000001122211 |
4 | 1213101323322113221 |
5 | 3304103424413441 |
6 | 122540045045121 |
7 | 11004054135100 |
oct | 1472173722751 |
9 | 347216001584 |
10 | 110896326121 |
11 | 430380a31a9 |
12 | 195aab567a1 |
13 | a5c41082a9 |
14 | 5520265037 |
15 | 2d40b4aa81 |
hex | 19d1efa5e9 |
110896326121 has 27 divisors (see below), whose sum is σ = 130463448453. Its totient is φ = 93989024640.
The previous prime is 110896326097. The next prime is 110896326173. The reversal of 110896326121 is 121623698011.
The square root of 110896326121 is 333011.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 106429275225 + 4467050896 = 326235^2 + 66836^2 .
It is not a de Polignac number, because 110896326121 - 211 = 110896324073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110896326181) 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 26 ways as a sum of consecutive naturals, for example, 263411491 + ... + 263411911.
Almost surely, 2110896326121 is an apocalyptic number.
110896326121 is the 333011-st square number.
110896326121 is the 166506-th centered octagonal number.
It is an amenable number.
110896326121 is a deficient number, since it is larger than the sum of its proper divisors (19567122332).
110896326121 is an frugal number, since it uses more digits than its factorization.
110896326121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082 (or 541 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 40.
The spelling of 110896326121 in words is "one hundred ten billion, eight hundred ninety-six million, three hundred twenty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •