Base | Representation |
---|---|
bin | 101100001111011101100… |
… | …100001000001011011101 |
3 | 101202122102212220011010001 |
4 | 230033131210020023131 |
5 | 344302422313114233 |
6 | 10244401544014301 |
7 | 432436312035304 |
oct | 54173544101335 |
9 | 11678385804101 |
10 | 3040259113693 |
11 | a7240401276a |
12 | 411280761391 |
13 | 190906496179 |
14 | a7213a7343b |
15 | 5413dd6027d |
hex | 2c3dd9082dd |
3040259113693 has 4 divisors (see below), whose sum is σ = 3040283276320. Its totient is φ = 3040234951068.
The previous prime is 3040259113667. The next prime is 3040259113763. The reversal of 3040259113693 is 3963119520403.
3040259113693 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3040259113693 - 29 = 3040259113181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3040259113993) 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, 11891583 + ... + 12144556.
It is an arithmetic number, because the mean of its divisors is an integer number (760070819080).
Almost surely, 23040259113693 is an apocalyptic number.
It is an amenable number.
3040259113693 is a deficient number, since it is larger than the sum of its proper divisors (24162627).
3040259113693 is a wasteful number, since it uses less digits than its factorization.
3040259113693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24162626.
The product of its (nonzero) digits is 524880, while the sum is 46.
The spelling of 3040259113693 in words is "three trillion, forty billion, two hundred fifty-nine million, one hundred thirteen thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •