Base | Representation |
---|---|
bin | 10000001001110111010… |
… | …011000010100110001001 |
3 | 10221010100222201111111211 |
4 | 100021313103002212021 |
5 | 121141442334324231 |
6 | 2205550240453121 |
7 | 143126250112531 |
oct | 20116723024611 |
9 | 3833328644454 |
10 | 1110103042441 |
11 | 398879255348 |
12 | 15b18b31a1a1 |
13 | 808b3c32cb3 |
14 | 3ba2d1b04c1 |
15 | 1dd22914eb1 |
hex | 102774c2989 |
1110103042441 has 2 divisors, whose sum is σ = 1110103042442. Its totient is φ = 1110103042440.
The previous prime is 1110103042421. The next prime is 1110103042459. The reversal of 1110103042441 is 1442403010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1070821388025 + 39281654416 = 1034805^2 + 198196^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110103042441 - 211 = 1110103040393 is a prime.
It is a super-3 number, since 3×11101030424413 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1110103042421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555051521220 + 555051521221.
It is an arithmetic number, because the mean of its divisors is an integer number (555051521221).
Almost surely, 21110103042441 is an apocalyptic number.
It is an amenable number.
1110103042441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110103042441 is an equidigital number, since it uses as much as digits as its factorization.
1110103042441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 1110103042441 its reverse (1442403010111), we get a palindrome (2552506052552).
The spelling of 1110103042441 in words is "one trillion, one hundred ten billion, one hundred three million, forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •