Base | Representation |
---|---|
bin | 10011000110100000101101… |
… | …10111011111110111011001 |
3 | 12111201122200002101012001012 |
4 | 21203100112313133313121 |
5 | 21001203033413131243 |
6 | 225200523355303305 |
7 | 11563526055122243 |
oct | 1143202667376731 |
9 | 174648602335035 |
10 | 42005163802073 |
11 | 1242532099187a |
12 | 4864a7044ab35 |
13 | 1a590ba8ac904 |
14 | a530bcaa9093 |
15 | 4cc9b6209d18 |
hex | 263416ddfdd9 |
42005163802073 has 2 divisors, whose sum is σ = 42005163802074. Its totient is φ = 42005163802072.
The previous prime is 42005163802031. The next prime is 42005163802099. The reversal of 42005163802073 is 37020836150024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35429672912089 + 6575490889984 = 5952283^2 + 2564272^2 .
It is a cyclic number.
It is not a de Polignac number, because 42005163802073 - 28 = 42005163801817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42005163802073.
It is not a weakly prime, because it can be changed into another prime (42005163802573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21002581901036 + 21002581901037.
It is an arithmetic number, because the mean of its divisors is an integer number (21002581901037).
Almost surely, 242005163802073 is an apocalyptic number.
It is an amenable number.
42005163802073 is a deficient number, since it is larger than the sum of its proper divisors (1).
42005163802073 is an equidigital number, since it uses as much as digits as its factorization.
42005163802073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 241920, while the sum is 41.
Adding to 42005163802073 its reverse (37020836150024), we get a palindrome (79025999952097).
The spelling of 42005163802073 in words is "forty-two trillion, five billion, one hundred sixty-three million, eight hundred two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •