Base | Representation |
---|---|
bin | 11001100101111100… |
… | …10100001011110101 |
3 | 1022110120102022110101 |
4 | 30302332110023311 |
5 | 211114431121133 |
6 | 10151225554101 |
7 | 664330623415 |
oct | 146276241365 |
9 | 38416368411 |
10 | 13740098293 |
11 | 5910a22239 |
12 | 27b5645931 |
13 | 13ac81059c |
14 | 944b80645 |
15 | 5563e537d |
hex | 332f942f5 |
13740098293 has 8 divisors (see below), whose sum is σ = 13971942296. Its totient is φ = 13508467200.
The previous prime is 13740098291. The next prime is 13740098347. The reversal of 13740098293 is 39289004731.
It can be written as a sum of positive squares in 4 ways, for example, as 1104764644 + 12635333649 = 33238^2 + 112407^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13740098293 - 21 = 13740098291 is a prime.
It is a super-2 number, since 2×137400982932 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13740098291) 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 in 7 ways as a sum of consecutive naturals, for example, 79705 + ... + 183937.
It is an arithmetic number, because the mean of its divisors is an integer number (1746492787).
Almost surely, 213740098293 is an apocalyptic number.
It is an amenable number.
13740098293 is a deficient number, since it is larger than the sum of its proper divisors (231844003).
13740098293 is a wasteful number, since it uses less digits than its factorization.
13740098293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106455.
The product of its (nonzero) digits is 326592, while the sum is 46.
The spelling of 13740098293 in words is "thirteen billion, seven hundred forty million, ninety-eight thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •