Search a number
-
+
99011010011001 = 3113000333636697
BaseRepresentation
bin10110100000110011001100…
…000101001001111101111001
3110222120100201112011121112220
4112200303030011021331321
5100434144022030323001
6550325010254554253
726566211062012524
oct2640631405117571
9428510645147486
1099011010011001
1129603373a37530
12b130bb6b08989
13433290cb9b61a
141a64230b23bbb
15b6a784923c36
hex5a0ccc149f79

99011010011001 has 8 divisors (see below), whose sum is σ = 144016014561504. Its totient is φ = 60006672733920.

The previous prime is 99011010010949. The next prime is 99011010011021. The reversal of 99011010011001 is 10011001011099.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 99011010011001 - 29 = 99011010010489 is a prime.

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

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

Almost surely, 299011010011001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3000333636711.

The product of its (nonzero) digits is 81, while the sum is 24.

The spelling of 99011010011001 in words is "ninety-nine trillion, eleven billion, ten million, eleven thousand, one".

Divisors: 1 3 11 33 3000333636697 9001000910091 33003670003667 99011010011001