Base | Representation |
---|---|
bin | 101100101001011000100… |
… | …001010000010110110111 |
3 | 101212022021120221012001001 |
4 | 230221120201100112313 |
5 | 400231422442341403 |
6 | 10305243434144131 |
7 | 434443113453664 |
oct | 54513041202667 |
9 | 11768246835031 |
10 | 3068091762103 |
11 | a831968a6435 |
12 | 416749882047 |
13 | 19342081b1b4 |
14 | a86d42dca6b |
15 | 54c1c56ac1d |
hex | 2ca588505b7 |
3068091762103 has 4 divisors (see below), whose sum is σ = 3073762911928. Its totient is φ = 3062420612280.
The previous prime is 3068091761957. The next prime is 3068091762121. The reversal of 3068091762103 is 3012671908603.
3068091762103 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3068091762103 - 225 = 3068058207671 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3068091762133) 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, 2835574101 + ... + 2835575182.
It is an arithmetic number, because the mean of its divisors is an integer number (768440727982).
Almost surely, 23068091762103 is an apocalyptic number.
3068091762103 is a deficient number, since it is larger than the sum of its proper divisors (5671149825).
3068091762103 is an equidigital number, since it uses as much as digits as its factorization.
3068091762103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5671149824.
The product of its (nonzero) digits is 326592, while the sum is 46.
The spelling of 3068091762103 in words is "three trillion, sixty-eight billion, ninety-one million, seven hundred sixty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •