Base | Representation |
---|---|
bin | 1100100001100010… |
… | …00100100010111001 |
3 | 122100120220220010111 |
4 | 12100301010202321 |
5 | 102232240000243 |
6 | 3031105144321 |
7 | 325422634615 |
oct | 62061044271 |
9 | 18316826114 |
10 | 6723750073 |
11 | 2940421a47 |
12 | 137792b0a1 |
13 | 832002451 |
14 | 47adaa345 |
15 | 29544c39d |
hex | 190c448b9 |
6723750073 has 2 divisors, whose sum is σ = 6723750074. Its totient is φ = 6723750072.
The previous prime is 6723750043. The next prime is 6723750091. The reversal of 6723750073 is 3700573276.
It is a happy number.
6723750073 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6723508009 + 242064 = 81997^2 + 492^2 .
It is a cyclic number.
It is not a de Polignac number, because 6723750073 - 25 = 6723750041 is a prime.
It is not a weakly prime, because it can be changed into another prime (6723750043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3361875036 + 3361875037.
It is an arithmetic number, because the mean of its divisors is an integer number (3361875037).
Almost surely, 26723750073 is an apocalyptic number.
It is an amenable number.
6723750073 is a deficient number, since it is larger than the sum of its proper divisors (1).
6723750073 is an equidigital number, since it uses as much as digits as its factorization.
6723750073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 185220, while the sum is 40.
The square root of 6723750073 is about 81998.4760407168. The cubic root of 6723750073 is about 1887.4285525811.
The spelling of 6723750073 in words is "six billion, seven hundred twenty-three million, seven hundred fifty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •