Search a number
-
+
101110511051 = 1152361928393
BaseRepresentation
bin101111000101010100…
…1111111010111001011
3100122222120021011000122
41132022221333113023
53124033242323201
6114241033053455
710206420110024
oct1361251772713
9318876234018
10101110511051
113997627a530
121771985728b
1396c4900784
144c72737c4b
15296b999e1b
hex178aa7f5cb

101110511051 has 16 divisors (see below), whose sum is σ = 110695712640. Its totient is φ = 91591456320.

The previous prime is 101110511039. The next prime is 101110511083. The reversal of 101110511051 is 150115011101.

It is a cyclic number.

It is not a de Polignac number, because 101110511051 - 210 = 101110510027 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3546911 + ... + 3575303.

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

Almost surely, 2101110511051 is an apocalyptic number.

101110511051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

101110511051 is a wasteful number, since it uses less digits than its factorization.

101110511051 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 29546.

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

Adding to 101110511051 its reverse (150115011101), we get a palindrome (251225522152).

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

Divisors: 1 11 523 619 5753 6809 28393 312323 323737 3561107 14849539 17575267 163344929 193327937 9191864641 101110511051