Base | Representation |
---|---|
bin | 110101111001111001100… |
… | …000000000010001011101 |
3 | 111010010110001102121020202 |
4 | 311321321200000101131 |
5 | 441142401330221023 |
6 | 11513422041553245 |
7 | 531425004352250 |
oct | 65717140002135 |
9 | 14103401377222 |
10 | 3704300242013 |
11 | 11a8a91a08898 |
12 | 4b9b027a5825 |
13 | 20b410b72537 |
14 | cb409389097 |
15 | 665560cc128 |
hex | 35e7980045d |
3704300242013 has 8 divisors (see below), whose sum is σ = 4233677218560. Its totient is φ = 3174971072400.
The previous prime is 3704300241977. The next prime is 3704300242021. The reversal of 3704300242013 is 3102420034073.
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 3704300242013 - 222 = 3704296047709 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3704300242813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11785538 + ... + 12095763.
It is an arithmetic number, because the mean of its divisors is an integer number (529209652320).
Almost surely, 23704300242013 is an apocalyptic number.
It is an amenable number.
3704300242013 is a deficient number, since it is larger than the sum of its proper divisors (529376976547).
3704300242013 is a wasteful number, since it uses less digits than its factorization.
3704300242013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23903467.
The product of its (nonzero) digits is 12096, while the sum is 29.
Adding to 3704300242013 its reverse (3102420034073), we get a palindrome (6806720276086).
The spelling of 3704300242013 in words is "three trillion, seven hundred four billion, three hundred million, two hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •