Base | Representation |
---|---|
bin | 100101011000111110… |
… | …1101100101100001001 |
3 | 21200020220111100222002 |
4 | 1022301331230230021 |
5 | 2303421024334033 |
6 | 100515335440345 |
7 | 5541534351131 |
oct | 1126175545411 |
9 | 250226440862 |
10 | 80295152393 |
11 | 3106457a485 |
12 | 1368a8260b5 |
13 | 77583262c1 |
14 | 3c5a049ac1 |
15 | 214e3713e8 |
hex | 12b1f6cb09 |
80295152393 has 4 divisors (see below), whose sum is σ = 80370265860. Its totient is φ = 80220038928.
The previous prime is 80295152389. The next prime is 80295152401. The reversal of 80295152393 is 39325159208.
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 54696112384 + 25599040009 = 233872^2 + 159997^2 .
It is a cyclic number.
It is not a de Polignac number, because 80295152393 - 22 = 80295152389 is a prime.
It is a super-2 number, since 2×802951523932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (80295154393) 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 3 ways as a sum of consecutive naturals, for example, 37555130 + ... + 37557267.
It is an arithmetic number, because the mean of its divisors is an integer number (20092566465).
Almost surely, 280295152393 is an apocalyptic number.
It is an amenable number.
80295152393 is a deficient number, since it is larger than the sum of its proper divisors (75113467).
80295152393 is a wasteful number, since it uses less digits than its factorization.
80295152393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75113466.
The product of its (nonzero) digits is 583200, while the sum is 47.
The spelling of 80295152393 in words is "eighty billion, two hundred ninety-five million, one hundred fifty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •