Search a number
-
+
99014866259 = 211469264769
BaseRepresentation
bin101110000110110111…
…1101111010101010011
3100110120111221100210212
41130031233233111103
53110240301210014
6113253052114335
710103452322321
oct1341557572523
9313514840725
1099014866259
1138aa0346591
1217233a659ab
13944c6a907a
144b142a2d11
1528979e323e
hex170dbef553

99014866259 has 4 divisors (see below), whose sum is σ = 99484131240. Its totient is φ = 98545601280.

The previous prime is 99014866229. The next prime is 99014866261. The reversal of 99014866259 is 95266841099.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 95266841099 = 791205909381.

It is a cyclic number.

It is not a de Polignac number, because 99014866259 - 232 = 94719898963 is a prime.

It is a Duffinian number.

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

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

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

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

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

Almost surely, 299014866259 is an apocalyptic number.

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

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

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

The sum of its prime factors is 469264980.

The product of its (nonzero) digits is 8398080, while the sum is 59.

The spelling of 99014866259 in words is "ninety-nine billion, fourteen million, eight hundred sixty-six thousand, two hundred fifty-nine".

Divisors: 1 211 469264769 99014866259