Base | Representation |
---|---|
bin | 1100111000001000001… |
… | …10100001111001010101 |
3 | 1120022001010120202202202 |
4 | 12130010012201321111 |
5 | 24222114303431203 |
6 | 535131532414245 |
7 | 43652222534621 |
oct | 6340406417125 |
9 | 1508033522682 |
10 | 442450452053 |
11 | 160707822325 |
12 | 718bb917385 |
13 | 3295229261c |
14 | 175b3da4181 |
15 | b7985c0388 |
hex | 67041a1e55 |
442450452053 has 4 divisors (see below), whose sum is σ = 442560545760. Its totient is φ = 442340358348.
The previous prime is 442450452023. The next prime is 442450452079. The reversal of 442450452053 is 350254054244.
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 442450452053 - 28 = 442450451797 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 442450451998 and 442450452016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (442450452023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55040825 + ... + 55048862.
It is an arithmetic number, because the mean of its divisors is an integer number (110640136440).
Almost surely, 2442450452053 is an apocalyptic number.
It is an amenable number.
442450452053 is a deficient number, since it is larger than the sum of its proper divisors (110093707).
442450452053 is a wasteful number, since it uses less digits than its factorization.
442450452053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110093706.
The product of its (nonzero) digits is 384000, while the sum is 38.
The spelling of 442450452053 in words is "four hundred forty-two billion, four hundred fifty million, four hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •