Base | Representation |
---|---|
bin | 101100011101100000100… |
… | …010101010000011011111 |
3 | 101211002100222221222120222 |
4 | 230131200202222003133 |
5 | 400024314402222333 |
6 | 10255334322431555 |
7 | 433512131531555 |
oct | 54354042520337 |
9 | 11732328858528 |
10 | 3055341445343 |
11 | a78843658770 |
12 | 41418b8025bb |
13 | 19216b0aa975 |
14 | a7c44ba9bd5 |
15 | 54722ed9298 |
hex | 2c7608aa0df |
3055341445343 has 4 divisors (see below), whose sum is σ = 3333099758568. Its totient is φ = 2777583132120.
The previous prime is 3055341445319. The next prime is 3055341445381. The reversal of 3055341445343 is 3435441435503.
It is a happy number.
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 3055341445343 - 28 = 3055341445087 is a prime.
It is a super-2 number, since 2×30553414453432 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3055341445294 and 3055341445303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3055341445243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138879156596 + ... + 138879156617.
It is an arithmetic number, because the mean of its divisors is an integer number (833274939642).
Almost surely, 23055341445343 is an apocalyptic number.
3055341445343 is a deficient number, since it is larger than the sum of its proper divisors (277758313225).
3055341445343 is a wasteful number, since it uses less digits than its factorization.
3055341445343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277758313224.
The product of its (nonzero) digits is 2592000, while the sum is 44.
The spelling of 3055341445343 in words is "three trillion, fifty-five billion, three hundred forty-one million, four hundred forty-five thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •