Search a number
-
+
10000009999489 is a prime number
BaseRepresentation
bin1001000110000100111100…
…0010110011010010000001
31022101222202220001021112211
42101201033002303102001
52302320010024440424
633133535143222121
72051322366342316
oct221411702632201
938358686037484
1010000009999489
113205a86a43864
12115609b147941
13576cc6249a93
142680085b2d0d
151251cac6ab94
hex9184f0b3481

10000009999489 has 2 divisors, whose sum is σ = 10000009999490. Its totient is φ = 10000009999488.

The previous prime is 10000009999481. The next prime is 10000009999501. The reversal of 10000009999489 is 98499990000001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6814527516225 + 3185482483264 = 2610465^2 + 1784792^2 .

It is a cyclic number.

It is not a de Polignac number, because 10000009999489 - 23 = 10000009999481 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10000009999481) 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 as a sum of consecutive naturals, namely, 5000004999744 + 5000004999745.

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

Almost surely, 210000009999489 is an apocalyptic number.

It is an amenable number.

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

10000009999489 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 1889568, while the sum is 58.

The spelling of 10000009999489 in words is "ten trillion, nine million, nine hundred ninety-nine thousand, four hundred eighty-nine".