Search a number
-
+
101101014505 = 547430217083
BaseRepresentation
bin101111000101000010…
…1110000110111101001
3100122221220101200012201
41132022011300313221
53124023324431010
6114240053340201
710206243305221
oct1361205606751
9318856350181
10101101014505
1139970983647
1217716637661
1396c295710a
144c71385081
15296ac2123a
hex178a170de9

101101014505 has 8 divisors (see below), whose sum is σ = 123902520192. Its totient is φ = 79159943088.

The previous prime is 101101014499. The next prime is 101101014527. The reversal of 101101014505 is 505410101101.

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 101101014505 - 25 = 101101014473 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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, 215108307 + ... + 215108776.

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

Almost surely, 2101101014505 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 430217135.

The product of its (nonzero) digits is 100, while the sum is 19.

Adding to 101101014505 its reverse (505410101101), we get a palindrome (606511115606).

The spelling of 101101014505 in words is "one hundred one billion, one hundred one million, fourteen thousand, five hundred five".

Divisors: 1 5 47 235 430217083 2151085415 20220202901 101101014505