Base | Representation |
---|---|
bin | 100110001001000101100… |
… | …010100111111110010101 |
3 | 100021120111201222002212001 |
4 | 212021011202213332111 |
5 | 320421001232130333 |
6 | 5324040515555301 |
7 | 360240135546505 |
oct | 46110542477625 |
9 | 10246451862761 |
10 | 2621096755093 |
11 | 920667871773 |
12 | 363b9bbbbb31 |
13 | 160225b821cb |
14 | 90c0c951a05 |
15 | 482aa00ab7d |
hex | 262458a7f95 |
2621096755093 has 2 divisors, whose sum is σ = 2621096755094. Its totient is φ = 2621096755092.
The previous prime is 2621096755061. The next prime is 2621096755267. The reversal of 2621096755093 is 3905576901262.
2621096755093 is digitally balanced in base 2 and base 3, because in such bases 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., 1722861006084 + 898235749009 = 1312578^2 + 947753^2 .
It is a cyclic number.
It is not a de Polignac number, because 2621096755093 - 25 = 2621096755061 is a prime.
It is a super-3 number, since 3×26210967550933 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2621096755993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1310548377546 + 1310548377547.
It is an arithmetic number, because the mean of its divisors is an integer number (1310548377547).
Almost surely, 22621096755093 is an apocalyptic number.
It is an amenable number.
2621096755093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2621096755093 is an equidigital number, since it uses as much as digits as its factorization.
2621096755093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6123600, while the sum is 55.
The spelling of 2621096755093 in words is "two trillion, six hundred twenty-one billion, ninety-six million, seven hundred fifty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •