Search a number
-
+
110010051051 = 337991081541
BaseRepresentation
bin110011001110100011…
…1000010100111101011
3101111221210022121211020
41212131013002213223
53300300033113201
6122312105103523
710643103001545
oct1463507024753
9344853277736
10110010051051
114272289566a
12193a2187ba3
13a4b2608a84
14547867c695
152cdce30a36
hex199d1c29eb

110010051051 has 8 divisors (see below), whose sum is σ = 150644394384. Its totient is φ = 71357870880.

The previous prime is 110010051037. The next prime is 110010051059. The reversal of 110010051051 is 150150010011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 110010051051 - 211 = 110010049003 is a prime.

It is a super-2 number, since 2×1100100510512 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 110010051051.

It is not an unprimeable number, because it can be changed into a prime (110010051059) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 495540660 + ... + 495540881.

It is an arithmetic number, because the mean of its divisors is an integer number (18830549298).

Almost surely, 2110010051051 is an apocalyptic number.

110010051051 is a deficient number, since it is larger than the sum of its proper divisors (40634343333).

110010051051 is an equidigital number, since it uses as much as digits as its factorization.

110010051051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 991081581.

The product of its (nonzero) digits is 25, while the sum is 15.

Adding to 110010051051 its reverse (150150010011), we get a palindrome (260160061062).

The spelling of 110010051051 in words is "one hundred ten billion, ten million, fifty-one thousand, fifty-one".

Divisors: 1 3 37 111 991081541 2973244623 36670017017 110010051051