Base | Representation |
---|---|
bin | 110011001111110001… |
… | …1011100001001000011 |
3 | 101112001122110120212201 |
4 | 1212133203130021003 |
5 | 3300341032100201 |
6 | 122320131534031 |
7 | 10644111330265 |
oct | 1463743341103 |
9 | 345048416781 |
10 | 110051050051 |
11 | 42743a48838 |
12 | 193b3a5a317 |
13 | a4bac62237 |
14 | 547dcb1b35 |
15 | 2ce182d801 |
hex | 199f8dc243 |
110051050051 has 8 divisors (see below), whose sum is σ = 116610387200. Its totient is φ = 103568430600.
The previous prime is 110051050033. The next prime is 110051050061. The reversal of 110051050051 is 150050150011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110051050051 - 29 = 110051049539 is a prime.
It is a super-2 number, since 2×1100510500512 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (110051050061) 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 7 ways as a sum of consecutive naturals, for example, 19176471 + ... + 19182208.
It is an arithmetic number, because the mean of its divisors is an integer number (14576298400).
Almost surely, 2110051050051 is an apocalyptic number.
110051050051 is a deficient number, since it is larger than the sum of its proper divisors (6559337149).
110051050051 is a wasteful number, since it uses less digits than its factorization.
110051050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38358849.
The product of its (nonzero) digits is 125, while the sum is 19.
The spelling of 110051050051 in words is "one hundred ten billion, fifty-one million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •