Base | Representation |
---|---|
bin | 10010010101110111111110… |
… | …011101110010001101110101 |
3 | 101120121210100002210121100011 |
4 | 102111313332131302031311 |
5 | 41033131131300210101 |
6 | 443322220210420221 |
7 | 22664034323360050 |
oct | 2225677635621565 |
9 | 346553302717304 |
10 | 80668050006901 |
11 | 23781145243065 |
12 | 906a012891671 |
13 | 3601c6cc4b2a6 |
14 | 15cc4d6891a97 |
15 | 94d563ad1751 |
hex | 495dfe772375 |
80668050006901 has 8 divisors (see below), whose sum is σ = 92199484306944. Its totient is φ = 69138472495920.
The previous prime is 80668050006833. The next prime is 80668050006967. The reversal of 80668050006901 is 10960005086608.
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 80668050006901 - 27 = 80668050006773 is a prime.
It is a super-2 number, since 2×806680500069012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80668050007901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 464104165 + ... + 464277946.
It is an arithmetic number, because the mean of its divisors is an integer number (11524935538368).
Almost surely, 280668050006901 is an apocalyptic number.
It is an amenable number.
80668050006901 is a deficient number, since it is larger than the sum of its proper divisors (11531434300043).
80668050006901 is a wasteful number, since it uses less digits than its factorization.
80668050006901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928394531.
The product of its (nonzero) digits is 622080, while the sum is 49.
The spelling of 80668050006901 in words is "eighty trillion, six hundred sixty-eight billion, fifty million, six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •