Base | Representation |
---|---|
bin | 111110001001011011… |
… | …100001010100011001 |
3 | 20101020112122111210112 |
4 | 332021123201110121 |
5 | 2043130412434033 |
6 | 50353323454105 |
7 | 4551431235011 |
oct | 761133412431 |
9 | 211215574715 |
10 | 66730202393 |
11 | 263335067a8 |
12 | 10b23987335 |
13 | 63a5bab47a |
14 | 333065cc41 |
15 | 1b08526c48 |
hex | f896e1519 |
66730202393 has 2 divisors, whose sum is σ = 66730202394. Its totient is φ = 66730202392.
The previous prime is 66730202387. The next prime is 66730202417. The reversal of 66730202393 is 39320203766.
66730202393 is digitally balanced in base 2, 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., 64738186969 + 1992015424 = 254437^2 + 44632^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66730202393 is a prime.
It is a super-2 number, since 2×667302023932 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 66730202393.
It is not a weakly prime, because it can be changed into another prime (66730202093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33365101196 + 33365101197.
It is an arithmetic number, because the mean of its divisors is an integer number (33365101197).
Almost surely, 266730202393 is an apocalyptic number.
It is an amenable number.
66730202393 is a deficient number, since it is larger than the sum of its proper divisors (1).
66730202393 is an equidigital number, since it uses as much as digits as its factorization.
66730202393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 244944, while the sum is 41.
The spelling of 66730202393 in words is "sixty-six billion, seven hundred thirty million, two hundred two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •