Base | Representation |
---|---|
bin | 110011011011000110… |
… | …0111000001001001001 |
3 | 101120001010102121212022 |
4 | 1212312030320021021 |
5 | 3302130314331101 |
6 | 122421543454225 |
7 | 10656404052314 |
oct | 1466614701111 |
9 | 346033377768 |
10 | 110431011401 |
11 | 42919477387 |
12 | 1949b157375 |
13 | a54b8a8939 |
14 | 54b853b97b |
15 | 2d14d84a1b |
hex | 19b6338249 |
110431011401 has 2 divisors, whose sum is σ = 110431011402. Its totient is φ = 110431011400.
The previous prime is 110431011391. The next prime is 110431011437. The reversal of 110431011401 is 104110134011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64643571001 + 45787440400 = 254251^2 + 213980^2 .
It is a cyclic number.
It is not a de Polignac number, because 110431011401 - 210 = 110431010377 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110431011401.
It is not a weakly prime, because it can be changed into another prime (110431011461) 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, 55215505700 + 55215505701.
It is an arithmetic number, because the mean of its divisors is an integer number (55215505701).
Almost surely, 2110431011401 is an apocalyptic number.
It is an amenable number.
110431011401 is a deficient number, since it is larger than the sum of its proper divisors (1).
110431011401 is an equidigital number, since it uses as much as digits as its factorization.
110431011401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 110431011401 its reverse (104110134011), we get a palindrome (214541145412).
The spelling of 110431011401 in words is "one hundred ten billion, four hundred thirty-one million, eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •