Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1000010100111101010 |
3 | 101111221210022121211012 |
4 | 1212131013002213222 |
5 | 3300300033113200 |
6 | 122312105103522 |
7 | 10643103001544 |
oct | 1463507024752 |
9 | 344853277735 |
10 | 110010051050 |
11 | 42722895669 |
12 | 193a2187ba2 |
13 | a4b2608a83 |
14 | 547867c694 |
15 | 2cdce30a35 |
hex | 199d1c29ea |
110010051050 has 12 divisors (see below), whose sum is σ = 204618695046. Its totient is φ = 44004020400.
The previous prime is 110010051037. The next prime is 110010051059. The reversal of 110010051050 is 50150010011.
It can be written as a sum of positive squares in 3 ways, for example, as 73783400161 + 36226650889 = 271631^2 + 190333^2 .
It is a super-2 number, since 2×1100100510502 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110010051059) 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 5 ways as a sum of consecutive naturals, for example, 1100100461 + ... + 1100100560.
Almost surely, 2110010051050 is an apocalyptic number.
110010051050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110010051050 is a deficient number, since it is larger than the sum of its proper divisors (94608643996).
110010051050 is a wasteful number, since it uses less digits than its factorization.
110010051050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200201033 (or 2200201028 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 14.
Adding to 110010051050 its reverse (50150010011), we get a palindrome (160160061061).
The spelling of 110010051050 in words is "one hundred ten billion, ten million, fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •