Base | Representation |
---|---|
bin | 1110001101011111100000101… |
… | …0000010011001000111001111 |
3 | 11212010200211002110012010011212 |
4 | 3203113320022002121013033 |
5 | 2022032424140401130431 |
6 | 13502452244304405035 |
7 | 420430266614025521 |
oct | 34327701202310717 |
9 | 4763624073163155 |
10 | 999997403926991 |
11 | 26a6a2576702558 |
12 | 941a624331677b |
13 | 33bca47325acb2 |
14 | 138d21bdbb7a11 |
15 | 7a9236244472b |
hex | 38d7e0a0991cf |
999997403926991 has 2 divisors, whose sum is σ = 999997403926992. Its totient is φ = 999997403926990.
The previous prime is 999997403926933. The next prime is 999997403927033. The reversal of 999997403926991 is 199629304799999.
It is a happy number.
999997403926991 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 999997403926991 - 238 = 999722526020047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 999997403926894 and 999997403926903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (999997403926931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 499998701963495 + 499998701963496.
It is an arithmetic number, because the mean of its divisors is an integer number (499998701963496).
Almost surely, 2999997403926991 is an apocalyptic number.
999997403926991 is a deficient number, since it is larger than the sum of its proper divisors (1).
999997403926991 is an equidigital number, since it uses as much as digits as its factorization.
999997403926991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43391094768, while the sum is 95.
The spelling of 999997403926991 in words is "nine hundred ninety-nine trillion, nine hundred ninety-seven billion, four hundred three million, nine hundred twenty-six thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •