Base | Representation |
---|---|
bin | 100110001110000000… |
… | …0100111001110000001 |
3 | 21211211220021111110112 |
4 | 1030130000213032001 |
5 | 2321042010120223 |
6 | 101412053041105 |
7 | 5633610023204 |
oct | 1143400471601 |
9 | 254756244415 |
10 | 82074301313 |
11 | 31897892394 |
12 | 13aa6626195 |
13 | 797cac5744 |
14 | 3d8845593b |
15 | 220565b778 |
hex | 131c027381 |
82074301313 has 4 divisors (see below), whose sum is σ = 82625135700. Its totient is φ = 81523466928.
The previous prime is 82074301301. The next prime is 82074301321. The reversal of 82074301313 is 31310347028.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3437242384 + 78637058929 = 58628^2 + 280423^2 .
It is a cyclic number.
It is not a de Polignac number, because 82074301313 - 216 = 82074235777 is a prime.
It is a super-2 number, since 2×820743013132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 82074301313.
It is not an unprimeable number, because it can be changed into a prime (82074301013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 275416970 + ... + 275417267.
It is an arithmetic number, because the mean of its divisors is an integer number (20656283925).
Almost surely, 282074301313 is an apocalyptic number.
It is an amenable number.
82074301313 is a deficient number, since it is larger than the sum of its proper divisors (550834387).
82074301313 is a wasteful number, since it uses less digits than its factorization.
82074301313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 550834386.
The product of its (nonzero) digits is 12096, while the sum is 32.
The spelling of 82074301313 in words is "eighty-two billion, seventy-four million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •