Base | Representation |
---|---|
bin | 101100001001101000110… |
… | …110111010000111001001 |
3 | 101202001022002210221020112 |
4 | 230021220312322013021 |
5 | 344202121032311431 |
6 | 10241445253004105 |
7 | 432125333431364 |
oct | 54115066720711 |
9 | 11661262727215 |
10 | 3034006135241 |
11 | a6a795404484 |
12 | 410016623635 |
13 | 19014ab84113 |
14 | a6bbd4110db |
15 | 53dc4e05c2b |
hex | 2c268dba1c9 |
3034006135241 has 4 divisors (see below), whose sum is σ = 3036898420500. Its totient is φ = 3031113849984.
The previous prime is 3034006135231. The next prime is 3034006135253. The reversal of 3034006135241 is 1425316004303.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2671168565641 + 362837569600 = 1634371^2 + 602360^2 .
It is a cyclic number.
It is not a de Polignac number, because 3034006135241 - 230 = 3032932393417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3034006135198 and 3034006135207.
It is not an unprimeable number, because it can be changed into a prime (3034006135201) 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, 1446141056 + ... + 1446143153.
It is an arithmetic number, because the mean of its divisors is an integer number (759224605125).
Almost surely, 23034006135241 is an apocalyptic number.
It is an amenable number.
3034006135241 is a deficient number, since it is larger than the sum of its proper divisors (2892285259).
3034006135241 is a wasteful number, since it uses less digits than its factorization.
3034006135241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2892285258.
The product of its (nonzero) digits is 25920, while the sum is 32.
The spelling of 3034006135241 in words is "three trillion, thirty-four billion, six million, one hundred thirty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •