Base | Representation |
---|---|
bin | 100111011011001111… |
… | …101101001101101101 |
3 | 11001021021001220120011 |
4 | 213123033231031231 |
5 | 1143144224031300 |
6 | 31240355453221 |
7 | 3026023563142 |
oct | 473317551555 |
9 | 131237056504 |
10 | 42333033325 |
11 | 16a53991560 |
12 | 82552b7211 |
13 | 3cb852225b |
14 | 20983983c9 |
15 | 117b730eba |
hex | 9db3ed36d |
42333033325 has 24 divisors (see below), whose sum is σ = 57392755200. Its totient is φ = 30719001600.
The previous prime is 42333033319. The next prime is 42333033331. The reversal of 42333033325 is 52333033324.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (42333033319) and next prime (42333033331).
It is not a de Polignac number, because 42333033325 - 29 = 42333032813 is a prime.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 47949 + ... + 294898.
It is an arithmetic number, because the mean of its divisors is an integer number (2391364800).
Almost surely, 242333033325 is an apocalyptic number.
It is an amenable number.
42333033325 is a deficient number, since it is larger than the sum of its proper divisors (15059721875).
42333033325 is a wasteful number, since it uses less digits than its factorization.
42333033325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343317 (or 343312 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 31.
Adding to 42333033325 its reverse (52333033324), we get a palindrome (94666066649).
Subtracting 42333033325 from its reverse (52333033324), we obtain a palindrome (9999999999).
The spelling of 42333033325 in words is "forty-two billion, three hundred thirty-three million, thirty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •