Base | Representation |
---|---|
bin | 1101000010101101… |
… | …0001110011111001 |
3 | 100000222202112110121 |
4 | 3100223101303321 |
5 | 24132224143243 |
6 | 1335222413241 |
7 | 152521026535 |
oct | 32053216371 |
9 | 10028675417 |
10 | 3501006073 |
11 | 1537254754 |
12 | 818591221 |
13 | 43a42c536 |
14 | 252d80bc5 |
15 | 15755a1ed |
hex | d0ad1cf9 |
3501006073 has 2 divisors, whose sum is σ = 3501006074. Its totient is φ = 3501006072.
The previous prime is 3501006071. The next prime is 3501006143. The reversal of 3501006073 is 3706001053.
It is a happy number.
3501006073 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3487256809 + 13749264 = 59053^2 + 3708^2 .
It is a cyclic number.
It is not a de Polignac number, because 3501006073 - 21 = 3501006071 is a prime.
Together with 3501006071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3501006071) 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 as a sum of consecutive naturals, namely, 1750503036 + 1750503037.
It is an arithmetic number, because the mean of its divisors is an integer number (1750503037).
Almost surely, 23501006073 is an apocalyptic number.
It is an amenable number.
3501006073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3501006073 is an equidigital number, since it uses as much as digits as its factorization.
3501006073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 25.
The square root of 3501006073 is about 59169.3000888129. The cubic root of 3501006073 is about 1518.4399496284.
The spelling of 3501006073 in words is "three billion, five hundred one million, six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •