Base | Representation |
---|---|
bin | 10011000110011011110010… |
… | …10111001010011001111101 |
3 | 12111201101211221001022022022 |
4 | 21203031321113022121331 |
5 | 21001132130423141103 |
6 | 225155405241325525 |
7 | 11563403430213302 |
oct | 1143157127123175 |
9 | 174641757038268 |
10 | 42002521302653 |
11 | 124241952a995a |
12 | 48644534968a5 |
13 | 1a58a892a95a2 |
14 | a52d0bb630a9 |
15 | 4cc8ae232138 |
hex | 2633795ca67d |
42002521302653 has 4 divisors (see below), whose sum is σ = 42003397370400. Its totient is φ = 42001645234908.
The previous prime is 42002521302619. The next prime is 42002521302733. The reversal of 42002521302653 is 35620312520024.
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 42002521302653 - 212 = 42002521298557 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 (42002521302253) 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, 437961953 + ... + 438057846.
It is an arithmetic number, because the mean of its divisors is an integer number (10500849342600).
Almost surely, 242002521302653 is an apocalyptic number.
It is an amenable number.
42002521302653 is a deficient number, since it is larger than the sum of its proper divisors (876067747).
42002521302653 is an equidigital number, since it uses as much as digits as its factorization.
42002521302653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876067746.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 42002521302653 its reverse (35620312520024), we get a palindrome (77622833822677).
The spelling of 42002521302653 in words is "forty-two trillion, two billion, five hundred twenty-one million, three hundred two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.653 sec. • engine limits •