Base | Representation |
---|---|
bin | 11101000000100111011… |
… | …10001100101011110001 |
3 | 10112021211010222112112222 |
4 | 32200103232030223301 |
5 | 112312332400242403 |
6 | 2041523504330425 |
7 | 132004503113525 |
oct | 16402356145361 |
9 | 3467733875488 |
10 | 996763290353 |
11 | 3547a798a046 |
12 | 14121a013a15 |
13 | 72cc084602c |
14 | 3635a623d85 |
15 | 1addc516338 |
hex | e813b8caf1 |
996763290353 has 2 divisors, whose sum is σ = 996763290354. Its totient is φ = 996763290352.
The previous prime is 996763290331. The next prime is 996763290421. The reversal of 996763290353 is 353092367699.
996763290353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 756225030544 + 240538259809 = 869612^2 + 490447^2 .
It is an emirp because it is prime and its reverse (353092367699) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 996763290353 - 212 = 996763286257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (996763290323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 498381645176 + 498381645177.
It is an arithmetic number, because the mean of its divisors is an integer number (498381645177).
Almost surely, 2996763290353 is an apocalyptic number.
It is an amenable number.
996763290353 is a deficient number, since it is larger than the sum of its proper divisors (1).
996763290353 is an equidigital number, since it uses as much as digits as its factorization.
996763290353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 49601160, while the sum is 62.
The spelling of 996763290353 in words is "nine hundred ninety-six billion, seven hundred sixty-three million, two hundred ninety thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •