Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …001011011100111000011001 |
3 | 112102111221122110000021020011 |
4 | 121000313233023130320121 |
5 | 103404410022041441303 |
6 | 1025550205500401521 |
7 | 32113014246064552 |
oct | 3100675713347031 |
9 | 472457573007204 |
10 | 110011010108953 |
11 | 32064453252a98 |
12 | 10408a548462a1 |
13 | 494ccbc328125 |
14 | 1d247c02c3329 |
15 | cab98b0ec16d |
hex | 640def2dce19 |
110011010108953 has 2 divisors, whose sum is σ = 110011010108954. Its totient is φ = 110011010108952.
The previous prime is 110011010108917. The next prime is 110011010109041. The reversal of 110011010108953 is 359801010110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76664681570569 + 33346328538384 = 8755837^2 + 5774628^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110011010108953 is a prime.
It is not a weakly prime, because it can be changed into another prime (110011010109953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005505054476 + 55005505054477.
It is an arithmetic number, because the mean of its divisors is an integer number (55005505054477).
Almost surely, 2110011010108953 is an apocalyptic number.
It is an amenable number.
110011010108953 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011010108953 is an equidigital number, since it uses as much as digits as its factorization.
110011010108953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 31.
Adding to 110011010108953 its reverse (359801010110011), we get a palindrome (469812020218964).
The spelling of 110011010108953 in words is "one hundred ten trillion, eleven billion, ten million, one hundred eight thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •