Base | Representation |
---|---|
bin | 1010111010101011111110… |
… | …1111110100001011011011 |
3 | 1120111111202111020122021202 |
4 | 2232222333233310023123 |
5 | 3033130333013422041 |
6 | 41310133200224415 |
7 | 2346133225136363 |
oct | 256527757641333 |
9 | 46444674218252 |
10 | 12003355607771 |
11 | 390865a34a670 |
12 | 141a3b760b10b |
13 | 690bb0971908 |
14 | 2d6d735119a3 |
15 | 15c37c809a9b |
hex | aeabfbf42db |
12003355607771 has 8 divisors (see below), whose sum is σ = 13094594927424. Its totient is φ = 10912120483720.
The previous prime is 12003355607753. The next prime is 12003355607773. The reversal of 12003355607771 is 17770655330021.
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 12003355607771 - 218 = 12003355345627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12003355607773) 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, 9924440 + ... + 11068026.
It is an arithmetic number, because the mean of its divisors is an integer number (1636824365928).
Almost surely, 212003355607771 is an apocalyptic number.
12003355607771 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12003355607771 is a deficient number, since it is larger than the sum of its proper divisors (1091239319653).
12003355607771 is a wasteful number, since it uses less digits than its factorization.
12003355607771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2097801.
The product of its (nonzero) digits is 926100, while the sum is 47.
The spelling of 12003355607771 in words is "twelve trillion, three billion, three hundred fifty-five million, six hundred seven thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •