Search a number
-
+
115013023550419 = 1045931099624483
BaseRepresentation
bin11010001001101010001110…
…011010011100101111010011
3120002020010201100202211002111
4122021222032122130233103
5110033333133012103134
61044340130440130151
733140262640603531
oct3211521632345723
9502203640684074
10115013023550419
1133712827457965
1210a96364a66957
134c238b2591877
142058935223151
15d46b45488c64
hex689a8e69cbd3

115013023550419 has 4 divisors (see below), whose sum is σ = 115014123279496. Its totient is φ = 115011923821344.

The previous prime is 115013023550407. The next prime is 115013023550423. The reversal of 115013023550419 is 914055320310511.

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

It is a cyclic number.

It is not a de Polignac number, because 115013023550419 - 213 = 115013023542227 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 2115013023550419 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1099729076.

The product of its (nonzero) digits is 81000, while the sum is 40.

The spelling of 115013023550419 in words is "one hundred fifteen trillion, thirteen billion, twenty-three million, five hundred fifty thousand, four hundred nineteen".

Divisors: 1 104593 1099624483 115013023550419