Base | Representation |
---|---|
bin | 101100001111100111111… |
… | …000011110100000110101 |
3 | 101202122212221121212121122 |
4 | 230033213320132200311 |
5 | 344303301122021323 |
6 | 10244431050153325 |
7 | 432443513313113 |
oct | 54174770364065 |
9 | 11678787555548 |
10 | 3040432220213 |
11 | a724927a7203 |
12 | 41130a722845 |
13 | 1909332c546b |
14 | a722ca54ab3 |
15 | 5414e155ec8 |
hex | 2c3e7e1e835 |
3040432220213 has 8 divisors (see below), whose sum is σ = 3047112866688. Its totient is φ = 3033752065344.
The previous prime is 3040432220201. The next prime is 3040432220291. The reversal of 3040432220213 is 3120222340403.
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 3040432220213 - 26 = 3040432220149 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 (3040432228213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14049770 + ... + 14264532.
It is an arithmetic number, because the mean of its divisors is an integer number (380889108336).
Almost surely, 23040432220213 is an apocalyptic number.
It is an amenable number.
3040432220213 is a deficient number, since it is larger than the sum of its proper divisors (6680646475).
3040432220213 is a wasteful number, since it uses less digits than its factorization.
3040432220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245803.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 3040432220213 its reverse (3120222340403), we get a palindrome (6160654560616).
The spelling of 3040432220213 in words is "three trillion, forty billion, four hundred thirty-two million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •