Base | Representation |
---|---|
bin | 111010110010010001110… |
… | …0001011011111110000011 |
3 | 1001121101102022220121122221 |
4 | 1311210203201123332003 |
5 | 2024333132414423101 |
6 | 25103345540511511 |
7 | 1462501536134455 |
oct | 165444341337603 |
9 | 31541368817587 |
10 | 8079429451651 |
11 | 2635515327958 |
12 | aa5a206ab597 |
13 | 467b6b7728ac |
14 | 1dd09173a2d5 |
15 | e02702d2aa1 |
hex | 7592385bf83 |
8079429451651 has 2 divisors, whose sum is σ = 8079429451652. Its totient is φ = 8079429451650.
The previous prime is 8079429451649. The next prime is 8079429451699. The reversal of 8079429451651 is 1561549249708.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 8079429451651 - 21 = 8079429451649 is a prime.
It is a super-4 number, since 4×80794294516514 (a number of 53 digits) contains 4444 as substring.
Together with 8079429451649, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 8079429451651.
It is not a weakly prime, because it can be changed into another prime (8079429451151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4039714725825 + 4039714725826.
It is an arithmetic number, because the mean of its divisors is an integer number (4039714725826).
Almost surely, 28079429451651 is an apocalyptic number.
8079429451651 is a deficient number, since it is larger than the sum of its proper divisors (1).
8079429451651 is an equidigital number, since it uses as much as digits as its factorization.
8079429451651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21772800, while the sum is 61.
The spelling of 8079429451651 in words is "eight trillion, seventy-nine billion, four hundred twenty-nine million, four hundred fifty-one thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •