Base | Representation |
---|---|
bin | 11110100001111011010… |
… | …101001101000000010001 |
3 | 21102120100010222002220202 |
4 | 132201323111031000101 |
5 | 233333212334240210 |
6 | 4243451451544545 |
7 | 304401502632665 |
oct | 36417325150021 |
9 | 7376303862822 |
10 | 2098013196305 |
11 | 739842832964 |
12 | 29a73845b155 |
13 | 122ac356a110 |
14 | 73789acc8a5 |
15 | 39892aae9a5 |
hex | 1e87b54d011 |
2098013196305 has 16 divisors (see below), whose sum is σ = 2711643978960. Its totient is φ = 1549093260288.
The previous prime is 2098013196277. The next prime is 2098013196347. The reversal of 2098013196305 is 5036913108902.
It is a Cunningham number, because it is equal to 14484522+1.
It can be written as a sum of positive squares in 8 ways, for example, as 1342727055121 + 755286141184 = 1158761^2 + 869072^2 .
It is a cyclic number.
It is not a de Polignac number, because 2098013196305 - 28 = 2098013196049 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2098013196305.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 1688060 + ... + 2654349.
It is an arithmetic number, because the mean of its divisors is an integer number (169477748685).
Almost surely, 22098013196305 is an apocalyptic number.
It is an amenable number.
2098013196305 is a deficient number, since it is larger than the sum of its proper divisors (613630782655).
2098013196305 is a wasteful number, since it uses less digits than its factorization.
2098013196305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4349860.
The product of its (nonzero) digits is 349920, while the sum is 47.
The spelling of 2098013196305 in words is "two trillion, ninety-eight billion, thirteen million, one hundred ninety-six thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.390 sec. • engine limits •