Base | Representation |
---|---|
bin | 101100011101010000000… |
… | …110100001000101011001 |
3 | 101211001122202222021100012 |
4 | 230131100012201011121 |
5 | 400023233300224423 |
6 | 10255251111051305 |
7 | 433502242262354 |
oct | 54352006410531 |
9 | 11731582867305 |
10 | 3055065633113 |
11 | a787119a497a |
12 | 414113370b35 |
13 | 192125bcb470 |
14 | a7c1a2d129b |
15 | 54708ba7078 |
hex | 2c7501a1159 |
3055065633113 has 8 divisors (see below), whose sum is σ = 3403521395400. Its totient is φ = 2722817115648.
The previous prime is 3055065633071. The next prime is 3055065633149. The reversal of 3055065633113 is 3113365605503.
It can be written as a sum of positive squares in 4 ways, for example, as 31907962384 + 3023157670729 = 178628^2 + 1738723^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3055065633113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3055065633173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4051810808 + ... + 4051811561.
It is an arithmetic number, because the mean of its divisors is an integer number (425440174425).
Almost surely, 23055065633113 is an apocalyptic number.
It is an amenable number.
3055065633113 is a deficient number, since it is larger than the sum of its proper divisors (348455762287).
3055065633113 is a wasteful number, since it uses less digits than its factorization.
3055065633113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8103622411.
The product of its (nonzero) digits is 364500, while the sum is 41.
The spelling of 3055065633113 in words is "three trillion, fifty-five billion, sixty-five million, six hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •