Search a number
-
+
101051101051 = 1019901101051
BaseRepresentation
bin101111000011100011…
…1010110111101111011
3100122211102110210211021
41132013013112331323
53123423040213201
6114231111443311
710205066121025
oct1360707267573
9318742423737
10101051101051
113994579195a
1217701986537
1396b54cc224
144c688b1015
152966661ea1
hex17871d6f7b

101051101051 has 8 divisors (see below), whose sum is σ = 102062924208. Its totient is φ = 100039500000.

The previous prime is 101051101037. The next prime is 101051101061. The reversal of 101051101051 is 150101150101.

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 101051101051 - 211 = 101051099003 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (101051101001) 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, 949476 + ... + 1050526.

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

Almost surely, 2101051101051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 111053.

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

Adding to 101051101051 its reverse (150101150101), we get a palindrome (251152251152).

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

Divisors: 1 101 9901 101051 1000001 10206151 1000505951 101051101051