Base | Representation |
---|---|
bin | 110011010111001100… |
… | …1111111100100101101 |
3 | 101112201000100100020002 |
4 | 1212232121333210231 |
5 | 3301343324410411 |
6 | 122400552434045 |
7 | 10653225334232 |
oct | 1465631774455 |
9 | 345630310202 |
10 | 110300231981 |
11 | 42861672915 |
12 | 194633a8925 |
13 | a52a779474 |
14 | 54a5017789 |
15 | 2d0865033b |
hex | 19ae67f92d |
110300231981 has 2 divisors, whose sum is σ = 110300231982. Its totient is φ = 110300231980.
The previous prime is 110300231959. The next prime is 110300231999. The reversal of 110300231981 is 189132003011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110151635881 + 148596100 = 331891^2 + 12190^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110300231981 is a prime.
It is a super-2 number, since 2×1103002319812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110300231941) 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 as a sum of consecutive naturals, namely, 55150115990 + 55150115991.
It is an arithmetic number, because the mean of its divisors is an integer number (55150115991).
Almost surely, 2110300231981 is an apocalyptic number.
It is an amenable number.
110300231981 is a deficient number, since it is larger than the sum of its proper divisors (1).
110300231981 is an equidigital number, since it uses as much as digits as its factorization.
110300231981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
Adding to 110300231981 its reverse (189132003011), we get a palindrome (299432234992).
The spelling of 110300231981 in words is "one hundred ten billion, three hundred million, two hundred thirty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •