Search a number
-
+
114020101055 = 5715881205133
BaseRepresentation
bin110101000110000100…
…0001010101110111111
3101220022020221021021202
41222030020022232333
53332003121213210
6124214034250115
711144344603460
oct1521410125677
9356266837252
10114020101055
11443a0413583
121a12112693b
13a9a1338a23
14573908ad67
152e74edd9a5
hex1a8c20abbf

114020101055 has 16 divisors (see below), whose sum is σ = 156381033024. Its totient is φ = 78179907840.

The previous prime is 114020101043. The next prime is 114020101079. The reversal of 114020101055 is 550101020411.

It is not a de Polignac number, because 114020101055 - 224 = 114003323839 is a prime.

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

It is a Duffinian number.

It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 453269 + ... + 658401.

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

Almost surely, 2114020101055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 221026.

The product of its (nonzero) digits is 200, while the sum is 20.

Adding to 114020101055 its reverse (550101020411), we get a palindrome (664121121466).

The spelling of 114020101055 in words is "one hundred fourteen billion, twenty million, one hundred one thousand, fifty-five".

Divisors: 1 5 7 35 15881 79405 111167 205133 555835 1025665 1435931 7179655 3257717173 16288585865 22804020211 114020101055