Base | Representation |
---|---|
bin | 11110011110011110100… |
… | …110000001101000101101 |
3 | 21102012210001110012002221 |
4 | 132132132212001220231 |
5 | 233303121304411303 |
6 | 4242040200115341 |
7 | 304210643634034 |
oct | 36363646015055 |
9 | 7365701405087 |
10 | 2094309841453 |
11 | 738212341615 |
12 | 299a84165b51 |
13 | 12265324049b |
14 | 73517d1771b |
15 | 397278d44bd |
hex | 1e79e981a2d |
2094309841453 has 2 divisors, whose sum is σ = 2094309841454. Its totient is φ = 2094309841452.
The previous prime is 2094309841361. The next prime is 2094309841549. The reversal of 2094309841453 is 3541489034902.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1763366214724 + 330943626729 = 1327918^2 + 575277^2 .
It is a cyclic number.
It is not a de Polignac number, because 2094309841453 - 213 = 2094309833261 is a prime.
It is a super-2 number, since 2×20943098414532 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2094309841453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2094309841853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1047154920726 + 1047154920727.
It is an arithmetic number, because the mean of its divisors is an integer number (1047154920727).
Almost surely, 22094309841453 is an apocalyptic number.
It is an amenable number.
2094309841453 is a deficient number, since it is larger than the sum of its proper divisors (1).
2094309841453 is an equidigital number, since it uses as much as digits as its factorization.
2094309841453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3732480, while the sum is 52.
The spelling of 2094309841453 in words is "two trillion, ninety-four billion, three hundred nine million, eight hundred forty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •