Base | Representation |
---|---|
bin | 11101110001010110110… |
… | …10111000101010110001 |
3 | 10121210100210112220012121 |
4 | 32320223122320222301 |
5 | 113224430223401333 |
6 | 2101532230354241 |
7 | 133622114232616 |
oct | 16705332705261 |
9 | 3553323486177 |
10 | 1022930684593 |
11 | 3649057816a4 |
12 | 1463014bb981 |
13 | 75600b9896c |
14 | 3771da5050d |
15 | 1b91e93332d |
hex | ee2b6b8ab1 |
1022930684593 has 2 divisors, whose sum is σ = 1022930684594. Its totient is φ = 1022930684592.
The previous prime is 1022930684591. The next prime is 1022930684639. The reversal of 1022930684593 is 3954860392201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 795036155904 + 227894528689 = 891648^2 + 477383^2 .
It is an emirp because it is prime and its reverse (3954860392201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1022930684593 - 21 = 1022930684591 is a prime.
Together with 1022930684591, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1022930684593.
It is not a weakly prime, because it can be changed into another prime (1022930684591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511465342296 + 511465342297.
It is an arithmetic number, because the mean of its divisors is an integer number (511465342297).
Almost surely, 21022930684593 is an apocalyptic number.
It is an amenable number.
1022930684593 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022930684593 is an equidigital number, since it uses as much as digits as its factorization.
1022930684593 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2799360, while the sum is 52.
The spelling of 1022930684593 in words is "one trillion, twenty-two billion, nine hundred thirty million, six hundred eighty-four thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •