Base | Representation |
---|---|
bin | 101100001111011100001… |
… | …001000111011011100001 |
3 | 101202122101020000000212001 |
4 | 230033130021013123201 |
5 | 344302400211134041 |
6 | 10244355332404001 |
7 | 432435602200042 |
oct | 54173411073341 |
9 | 11678336000761 |
10 | 3040235255521 |
11 | a723a15a7772 |
12 | 411274776601 |
13 | 1909015618c9 |
14 | a72108228c9 |
15 | 5413bbeb131 |
hex | 2c3dc2476e1 |
3040235255521 has 8 divisors (see below), whose sum is σ = 3070558393920. Its totient is φ = 3009947482608.
The previous prime is 3040235255509. The next prime is 3040235255531. The reversal of 3040235255521 is 1255525320403.
3040235255521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3040235255521 - 233 = 3031645320929 is a prime.
It is a super-4 number, since 4×30402352555214 (a number of 51 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3040235255501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8668566 + ... + 9012463.
It is an arithmetic number, because the mean of its divisors is an integer number (383819799240).
Almost surely, 23040235255521 is an apocalyptic number.
It is an amenable number.
3040235255521 is a deficient number, since it is larger than the sum of its proper divisors (30323138399).
3040235255521 is a wasteful number, since it uses less digits than its factorization.
3040235255521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17682743.
The product of its (nonzero) digits is 180000, while the sum is 37.
The spelling of 3040235255521 in words is "three trillion, forty billion, two hundred thirty-five million, two hundred fifty-five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •