Search a number
-
+
115433251401 = 31331101394253
BaseRepresentation
bin110101110000001011…
…0111010001001001001
3102000221202000202010110
41223200112322021021
53342401403021101
6125010155104533
711224354306356
oct1534026721111
9360852022113
10115433251401
1144a56074326
121a456442149
13ab6803cc70
145830a2362d
1530090cecd6
hex1ae05ba249

115433251401 has 32 divisors (see below), whose sum is σ = 171267812352. Its totient is φ = 68675777280.

The previous prime is 115433251393. The next prime is 115433251411. The reversal of 115433251401 is 104152334511.

It is not a de Polignac number, because 115433251401 - 23 = 115433251393 is a prime.

It is not an unprimeable number, because it can be changed into a prime (115433251411) 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 31 ways as a sum of consecutive naturals, for example, 1177591 + ... + 1271843.

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

Almost surely, 2115433251401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 95313.

The product of its (nonzero) digits is 7200, while the sum is 30.

Adding to 115433251401 its reverse (104152334511), we get a palindrome (219585585912).

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

Divisors: 1 3 13 31 39 93 403 1013 1209 3039 13169 31403 39507 94209 94253 282759 408239 1224717 1225289 2921843 3675867 8765529 37983959 95478289 113951877 286434867 1241217757 2959826959 3723653271 8879480877 38477750467 115433251401