Base | Representation |
---|---|
bin | 1101111111011110101101… |
… | …10100100101101000011111 |
3 | 11000221102202112001220021201 |
4 | 12333233112310211220133 |
5 | 13013102243420213403 |
6 | 145234455533340331 |
7 | 6323642665013134 |
oct | 677572664455037 |
9 | 130842675056251 |
10 | 30768454851103 |
11 | 98929126a4562 |
12 | 354b1713376a7 |
13 | 14225b6b84238 |
14 | 7852b5db058b |
15 | 3855589ca21d |
hex | 1bfbd6d25a1f |
30768454851103 has 4 divisors (see below), whose sum is σ = 30768466257040. Its totient is φ = 30768443445168.
The previous prime is 30768454851089. The next prime is 30768454851137. The reversal of 30768454851103 is 30115845486703.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30768454851103 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 (30768454851163) 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 3 ways as a sum of consecutive naturals, for example, 864118 + ... + 7891996.
It is an arithmetic number, because the mean of its divisors is an integer number (7692116564260).
Almost surely, 230768454851103 is an apocalyptic number.
30768454851103 is a deficient number, since it is larger than the sum of its proper divisors (11405937).
30768454851103 is an equidigital number, since it uses as much as digits as its factorization.
30768454851103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11405936.
The product of its (nonzero) digits is 9676800, while the sum is 55.
The spelling of 30768454851103 in words is "thirty trillion, seven hundred sixty-eight billion, four hundred fifty-four million, eight hundred fifty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •