Base | Representation |
---|---|
bin | 110011010101000111… |
… | …0001110011010001101 |
3 | 101112112010021010101211 |
4 | 1212222032032122031 |
5 | 3301222342210112 |
6 | 122350004134421 |
7 | 10651413602431 |
oct | 1465216163215 |
9 | 345463233354 |
10 | 110230038157 |
11 | 42825a8a198 |
12 | 19443997411 |
13 | a519070665 |
14 | 54999849c1 |
15 | 2d023d70a7 |
hex | 19aa38e68d |
110230038157 has 2 divisors, whose sum is σ = 110230038158. Its totient is φ = 110230038156.
The previous prime is 110230038109. The next prime is 110230038161. The reversal of 110230038157 is 751830032011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65395787076 + 44834251081 = 255726^2 + 211741^2 .
It is an emirp because it is prime and its reverse (751830032011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110230038157 - 211 = 110230036109 is a prime.
It is a super-2 number, since 2×1102300381572 (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 (110230038557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55115019078 + 55115019079.
It is an arithmetic number, because the mean of its divisors is an integer number (55115019079).
Almost surely, 2110230038157 is an apocalyptic number.
It is an amenable number.
110230038157 is a deficient number, since it is larger than the sum of its proper divisors (1).
110230038157 is an equidigital number, since it uses as much as digits as its factorization.
110230038157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 31.
The spelling of 110230038157 in words is "one hundred ten billion, two hundred thirty million, thirty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •