Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1100101010101000011 |
3 | 101112110002200120020200 |
4 | 1212220133211111003 |
5 | 3301142431042201 |
6 | 122343050340243 |
7 | 10650612222363 |
oct | 1465037452503 |
9 | 345402616220 |
10 | 110201034051 |
11 | 42810679a59 |
12 | 1943612a683 |
13 | a513056a74 |
14 | 5495b949a3 |
15 | 2ceeaa8386 |
hex | 19a87e5543 |
110201034051 has 24 divisors (see below), whose sum is σ = 161699176080. Its totient is φ = 72306279936.
The previous prime is 110201034023. The next prime is 110201034079. The reversal of 110201034051 is 150430102011.
It is an interprime number because it is at equal distance from previous prime (110201034023) and next prime (110201034079).
It is not a de Polignac number, because 110201034051 - 25 = 110201034019 is a prime.
It is a super-2 number, since 2×1102010340512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110201034011) 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 in 23 ways as a sum of consecutive naturals, for example, 599851 + ... + 761723.
It is an arithmetic number, because the mean of its divisors is an integer number (6737465670).
Almost surely, 2110201034051 is an apocalyptic number.
110201034051 is a deficient number, since it is larger than the sum of its proper divisors (51498142029).
110201034051 is a wasteful number, since it uses less digits than its factorization.
110201034051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163075 (or 163072 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 110201034051 its reverse (150430102011), we get a palindrome (260631136062).
The spelling of 110201034051 in words is "one hundred ten billion, two hundred one million, thirty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •