Search a number
-
+
99001110031 = 367269757793
BaseRepresentation
bin101110000110011101…
…1010000111000001111
3100110112120001110210221
41130030323100320033
53110223241010111
6113251441212211
710103224356565
oct1341473207017
9313476043727
1099001110031
1138a936002aa
121722b331067
1394498a08a5
144b12521a35
1528966c7371
hex170ced0e0f

99001110031 has 4 divisors (see below), whose sum is σ = 99270868192. Its totient is φ = 98731351872.

The previous prime is 99001110017. The next prime is 99001110077. The reversal of 99001110031 is 13001110099.

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 99001110031 - 213 = 99001101839 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

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

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

Almost surely, 299001110031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 269758160.

The product of its (nonzero) digits is 243, while the sum is 25.

The spelling of 99001110031 in words is "ninety-nine billion, one million, one hundred ten thousand, thirty-one".

Divisors: 1 367 269757793 99001110031