Base | Representation |
---|---|
bin | 110011010010110010… |
… | …0101110011111010001 |
3 | 101112022200111221122022 |
4 | 1212211210232133101 |
5 | 3301042411110031 |
6 | 122334140421225 |
7 | 10646445660533 |
oct | 1464544563721 |
9 | 345280457568 |
10 | 110152050641 |
11 | 42795a62aa6 |
12 | 19421847815 |
13 | a505b662b9 |
14 | 548d483853 |
15 | 2cea62e97b |
hex | 19a592e7d1 |
110152050641 has 2 divisors, whose sum is σ = 110152050642. Its totient is φ = 110152050640.
The previous prime is 110152050611. The next prime is 110152050653. The reversal of 110152050641 is 146050251011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110138360641 + 13690000 = 331871^2 + 3700^2 .
It is a cyclic number.
It is not a de Polignac number, because 110152050641 - 26 = 110152050577 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110152050641.
It is not a weakly prime, because it can be changed into another prime (110152050601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55076025320 + 55076025321.
It is an arithmetic number, because the mean of its divisors is an integer number (55076025321).
Almost surely, 2110152050641 is an apocalyptic number.
It is an amenable number.
110152050641 is a deficient number, since it is larger than the sum of its proper divisors (1).
110152050641 is an equidigital number, since it uses as much as digits as its factorization.
110152050641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 110152050641 in words is "one hundred ten billion, one hundred fifty-two million, fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •