Base | Representation |
---|---|
bin | 101100000011011001100… |
… | …100101010111010111101 |
3 | 101201102000020200001201122 |
4 | 230003121210222322331 |
5 | 344044411123321440 |
6 | 10234420432320325 |
7 | 431500332004013 |
oct | 54033144527275 |
9 | 11642006601648 |
10 | 3027307245245 |
11 | a67968022258 |
12 | 40a8670a30a5 |
13 | 18c62107729a |
14 | a67458768b3 |
15 | 53b31c697b5 |
hex | 2c0d992aebd |
3027307245245 has 8 divisors (see below), whose sum is σ = 3632808746040. Its totient is φ = 2421819095040.
The previous prime is 3027307245233. The next prime is 3027307245251. The reversal of 3027307245245 is 5425427037203.
It can be written as a sum of positive squares in 4 ways, for example, as 1447625267929 + 1579681977316 = 1203173^2 + 1256854^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3027307245245 - 232 = 3023012277949 is a prime.
It is a super-2 number, since 2×30273072452452 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3027307245196 and 3027307245205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2831816 + ... + 3751505.
It is an arithmetic number, because the mean of its divisors is an integer number (454101093255).
Almost surely, 23027307245245 is an apocalyptic number.
It is an amenable number.
3027307245245 is a deficient number, since it is larger than the sum of its proper divisors (605501500795).
3027307245245 is an equidigital number, since it uses as much as digits as its factorization.
3027307245245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6675295.
The product of its (nonzero) digits is 1411200, while the sum is 44.
The spelling of 3027307245245 in words is "three trillion, twenty-seven billion, three hundred seven million, two hundred forty-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •