Base | Representation |
---|---|
bin | 100111100110100001… |
… | …010100101110110101 |
3 | 11001202110000121211211 |
4 | 213212201110232311 |
5 | 1144041140413023 |
6 | 31311234201421 |
7 | 3033511513345 |
oct | 474641245665 |
9 | 131673017754 |
10 | 42522201013 |
11 | 17040745a96 |
12 | 82a8723271 |
13 | 4018785bb6 |
14 | 20b555ad25 |
15 | 118d14aa0d |
hex | 9e6854bb5 |
42522201013 has 8 divisors (see below), whose sum is σ = 42575321880. Its totient is φ = 42469109760.
The previous prime is 42522200983. The next prime is 42522201017. The reversal of 42522201013 is 31010222524.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3997147729 + 38525053284 = 63223^2 + 196278^2 .
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 42522201013 - 221 = 42520103861 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 (42522201017) 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, 4308981 + ... + 4318837.
It is an arithmetic number, because the mean of its divisors is an integer number (5321915235).
Almost surely, 242522201013 is an apocalyptic number.
It is an amenable number.
42522201013 is a deficient number, since it is larger than the sum of its proper divisors (53120867).
42522201013 is a wasteful number, since it uses less digits than its factorization.
42522201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14807.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 42522201013 its reverse (31010222524), we get a palindrome (73532423537).
The spelling of 42522201013 in words is "forty-two billion, five hundred twenty-two million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •