Base | Representation |
---|---|
bin | 111011011000100010110… |
… | …000100010100000100011 |
3 | 112110010021010001200221112 |
4 | 323120202300202200203 |
5 | 1013324440313041203 |
6 | 12402410011013535 |
7 | 600554036235530 |
oct | 73304260424043 |
9 | 15403233050845 |
10 | 4080802080803 |
11 | 133372742a948 |
12 | 55aa7843a2ab |
13 | 237a83161576 |
14 | 101724825d87 |
15 | 7123eab26d8 |
hex | 3b622c22823 |
4080802080803 has 8 divisors (see below), whose sum is σ = 4668002078208. Its totient is φ = 3494659151304.
The previous prime is 4080802080763. The next prime is 4080802080827. The reversal of 4080802080803 is 3080802080804.
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 4080802080803 - 28 = 4080802080547 is a prime.
It is a super-2 number, since 2×40808020808032 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4080802080203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 264258701 + ... + 264274142.
It is an arithmetic number, because the mean of its divisors is an integer number (583500259776).
Almost surely, 24080802080803 is an apocalyptic number.
4080802080803 is a deficient number, since it is larger than the sum of its proper divisors (587199997405).
4080802080803 is a wasteful number, since it uses less digits than its factorization.
4080802080803 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528533953.
The product of its (nonzero) digits is 98304, while the sum is 41.
Subtracting from 4080802080803 its reverse (3080802080804), we obtain a palindrome (999999999999).
The spelling of 4080802080803 in words is "four trillion, eighty billion, eight hundred two million, eighty thousand, eight hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •