Base | Representation |
---|---|
bin | 110111111000011101100… |
… | …0110101101100100100010 |
3 | 1000012020102210200201021020 |
4 | 1233300323012231210202 |
5 | 2001313421120444024 |
6 | 24200153543510310 |
7 | 1421614205352123 |
oct | 157607306554442 |
9 | 30166383621236 |
10 | 7680393140514 |
11 | 24a1266778236 |
12 | a40618158396 |
13 | 439347999c63 |
14 | 1c7a3955204a |
15 | d4bb82e6979 |
hex | 6fc3b1ad922 |
7680393140514 has 8 divisors (see below), whose sum is σ = 15360786281040. Its totient is φ = 2560131046836.
The previous prime is 7680393140503. The next prime is 7680393140543. The reversal of 7680393140514 is 4150413930867.
It is a sphenic number, since it is the product of 3 distinct primes.
7680393140514 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 640032761704 + ... + 640032761715.
It is an arithmetic number, because the mean of its divisors is an integer number (1920098285130).
Almost surely, 27680393140514 is an apocalyptic number.
7680393140514 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7680393140514 is a wasteful number, since it uses less digits than its factorization.
7680393140514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1280065523424.
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 7680393140514 in words is "seven trillion, six hundred eighty billion, three hundred ninety-three million, one hundred forty thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •