Base | Representation |
---|---|
bin | 10011000110011101000101… |
… | …01111110100100010000001 |
3 | 12111201110122022112220211001 |
4 | 21203032202233310202001 |
5 | 21001140041200220023 |
6 | 225200002203252001 |
7 | 11563426561010512 |
oct | 1143164257644201 |
9 | 174643568486731 |
10 | 42003215632513 |
11 | 12424511226193 |
12 | 4864607b1a001 |
13 | 1a58b6a0b1b65 |
14 | a52d76062a09 |
15 | 4cc9001846ad |
hex | 2633a2bf4881 |
42003215632513 has 4 divisors (see below), whose sum is σ = 43829442399168. Its totient is φ = 40176988865860.
The previous prime is 42003215632507. The next prime is 42003215632517. The reversal of 42003215632513 is 31523651230024.
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 42003215632513 - 25 = 42003215632481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42003215632517) 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, 913113383293 + ... + 913113383338.
It is an arithmetic number, because the mean of its divisors is an integer number (10957360599792).
Almost surely, 242003215632513 is an apocalyptic number.
It is an amenable number.
42003215632513 is a deficient number, since it is larger than the sum of its proper divisors (1826226766655).
42003215632513 is a wasteful number, since it uses less digits than its factorization.
42003215632513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1826226766654.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 42003215632513 its reverse (31523651230024), we get a palindrome (73526866862537).
The spelling of 42003215632513 in words is "forty-two trillion, three billion, two hundred fifteen million, six hundred thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •