Base | Representation |
---|---|
bin | 110010010010111010001100… |
… | …0101010100100111100111101 |
3 | 2011000102100210222100221102021 |
4 | 1210211310120222210330331 |
5 | 430441314402123422234 |
6 | 4204525212121200141 |
7 | 162120412435053316 |
oct | 14445643052447475 |
9 | 2130370728327367 |
10 | 442403520139069 |
11 | 118a66308756495 |
12 | 41750923930051 |
13 | 15cb161c086028 |
14 | 7b3663209760d |
15 | 3622de67aa9b4 |
hex | 1925d18aa4f3d |
442403520139069 has 2 divisors, whose sum is σ = 442403520139070. Its totient is φ = 442403520139068.
The previous prime is 442403520139057. The next prime is 442403520139099. The reversal of 442403520139069 is 960931025304244.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 247813240147225 + 194590279991844 = 15742085^2 + 13949562^2 .
It is a cyclic number.
It is not a de Polignac number, because 442403520139069 - 211 = 442403520137021 is a prime.
It is a super-2 number, since 2×4424035201390692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (442403520139099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 221201760069534 + 221201760069535.
It is an arithmetic number, because the mean of its divisors is an integer number (221201760069535).
Almost surely, 2442403520139069 is an apocalyptic number.
It is an amenable number.
442403520139069 is a deficient number, since it is larger than the sum of its proper divisors (1).
442403520139069 is an equidigital number, since it uses as much as digits as its factorization.
442403520139069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 52.
The spelling of 442403520139069 in words is "four hundred forty-two trillion, four hundred three billion, five hundred twenty million, one hundred thirty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •