Search a number
-
+
114015054130105 = 522803010826021
BaseRepresentation
bin11001111011001000110010…
…110011001110101110111001
3112221200201210011020112021111
4121323020302303032232321
5104421010312324130410
61042253443124040321
733005213220521062
oct3173106263165671
9487621704215244
10114015054130105
11333685707655a7
1210954a6ab330a1
134b8075bbb918b
142022502755569
15d2abd7125b8a
hex67b232ccebb9

114015054130105 has 4 divisors (see below), whose sum is σ = 136818064956132. Its totient is φ = 91212043304080.

The previous prime is 114015054130099. The next prime is 114015054130123. The reversal of 114015054130105 is 501031450510411.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 90075797143929 + 23939256986176 = 9490827^2 + 4892776^2 .

It is not a de Polignac number, because 114015054130105 - 223 = 114015045741497 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11401505413006 + ... + 11401505413015.

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

Almost surely, 2114015054130105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 22803010826026.

The product of its (nonzero) digits is 6000, while the sum is 31.

The spelling of 114015054130105 in words is "one hundred fourteen trillion, fifteen billion, fifty-four million, one hundred thirty thousand, one hundred five".

Divisors: 1 5 22803010826021 114015054130105