Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01000100111000110001 |
3 | 10112121011210022011210121 |
4 | 32203110231010320301 |
5 | 112341000223431321 |
6 | 2043221043530241 |
7 | 132150646146316 |
oct | 16432455047061 |
9 | 3477153264717 |
10 | 1000000998961 |
11 | 356109548488 |
12 | 141982389981 |
13 | 733b8558443 |
14 | 36586626d0d |
15 | 1b02b8b2441 |
hex | e8d4b44e31 |
1000000998961 has 2 divisors, whose sum is σ = 1000000998962. Its totient is φ = 1000000998960.
The previous prime is 1000000998911. The next prime is 1000000998979. The reversal of 1000000998961 is 1698990000001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 831269827600 + 168731171361 = 911740^2 + 410769^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000000998961 - 29 = 1000000998449 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000000998911) 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 as a sum of consecutive naturals, namely, 500000499480 + 500000499481.
It is an arithmetic number, because the mean of its divisors is an integer number (500000499481).
Almost surely, 21000000998961 is an apocalyptic number.
It is an amenable number.
1000000998961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000000998961 is an equidigital number, since it uses as much as digits as its factorization.
1000000998961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 43.
Adding to 1000000998961 its reverse (1698990000001), we get a palindrome (2698990998962).
The spelling of 1000000998961 in words is "one trillion, nine hundred ninety-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •