Search a number
-
+
114805029131 = 132743914293
BaseRepresentation
bin110101011101011101…
…0011011100100001011
3101222022221220202011222
41222322322123210023
53340110041413011
6124423554112255
711202655434512
oct1527272334413
9358287822158
10114805029131
114476349a671
121a2bbb7b68b
13aa97b42600
1457b1411679
152ebdd89ddb
hex1abae9b90b

114805029131 has 12 divisors (see below), whose sum is σ = 124482956688. Its totient is φ = 105831127584.

The previous prime is 114805029113. The next prime is 114805029139. The reversal of 114805029131 is 131920508411.

It is a happy number.

It is not a de Polignac number, because 114805029131 - 26 = 114805029067 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 114805029091 and 114805029100.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 331580 + ... + 582713.

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

Almost surely, 2114805029131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 915062 (or 915049 counting only the distinct ones).

The product of its (nonzero) digits is 8640, while the sum is 35.

The spelling of 114805029131 in words is "one hundred fourteen billion, eight hundred five million, twenty-nine thousand, one hundred thirty-one".

Divisors: 1 13 169 743 9659 125567 914293 11885809 154515517 679319699 8831156087 114805029131