Search a number
-
+
115033143451 = 2930712920717
BaseRepresentation
bin110101100100010000…
…0100111100010011011
3101222220212011011012111
41223020200213202123
53341041441042301
6124502343253151
711211425405032
oct1531040474233
9358825134174
10115033143451
11448702352a6
121a36444a1b7
13ab031914b5
1457d3831719
152ed3de9551
hex1ac882789b

115033143451 has 8 divisors (see below), whose sum is σ = 119387434320. Its totient is φ = 110704694688.

The previous prime is 115033143443. The next prime is 115033143553. The reversal of 115033143451 is 154341330511.

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 115033143451 - 23 = 115033143443 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6451456 + ... + 6469261.

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

Almost surely, 2115033143451 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12921053.

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

Adding to 115033143451 its reverse (154341330511), we get a palindrome (269374473962).

The spelling of 115033143451 in words is "one hundred fifteen billion, thirty-three million, one hundred forty-three thousand, four hundred fifty-one".

Divisors: 1 29 307 8903 12920717 374700793 3966660119 115033143451