Base | Representation |
---|---|
bin | 100001011000000110101… |
… | …011110110100001001101 |
3 | 22010021020122111211011122 |
4 | 201120012223312201031 |
5 | 300034320410213421 |
6 | 4513402053130325 |
7 | 324465105142103 |
oct | 41300653664115 |
9 | 8107218454148 |
10 | 2293624694861 |
11 | 8047a2388a65 |
12 | 31062a3299a5 |
13 | 138398620c76 |
14 | 7d025009c73 |
15 | 3e9e0b1c2ab |
hex | 21606af684d |
2293624694861 has 2 divisors, whose sum is σ = 2293624694862. Its totient is φ = 2293624694860.
The previous prime is 2293624694833. The next prime is 2293624694939. The reversal of 2293624694861 is 1684964263922.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2093247601636 + 200377093225 = 1446806^2 + 447635^2 .
It is a cyclic number.
It is not a de Polignac number, because 2293624694861 - 26 = 2293624694797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2293624694794 and 2293624694803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2293624654861) 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, 1146812347430 + 1146812347431.
It is an arithmetic number, because the mean of its divisors is an integer number (1146812347431).
Almost surely, 22293624694861 is an apocalyptic number.
It is an amenable number.
2293624694861 is a deficient number, since it is larger than the sum of its proper divisors (1).
2293624694861 is an equidigital number, since it uses as much as digits as its factorization.
2293624694861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 53747712, while the sum is 62.
The spelling of 2293624694861 in words is "two trillion, two hundred ninety-three billion, six hundred twenty-four million, six hundred ninety-four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •