Base | Representation |
---|---|
bin | 10111000101111100010… |
… | …00110110010011000101 |
3 | 2210212001212110011120211 |
4 | 23202332020312103011 |
5 | 101000003234114221 |
6 | 1404302354355421 |
7 | 111216530326624 |
oct | 13427610662305 |
9 | 2725055404524 |
10 | 793463973061 |
11 | 2865627aaa41 |
12 | 10994158bb71 |
13 | 59a91b23506 |
14 | 2a5922a36bb |
15 | 1598e5c66e1 |
hex | b8be2364c5 |
793463973061 has 2 divisors, whose sum is σ = 793463973062. Its totient is φ = 793463973060.
The previous prime is 793463972999. The next prime is 793463973083. The reversal of 793463973061 is 160379364397.
It is a happy number.
793463973061 is digitally balanced in base 2, 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., 440026589025 + 353437384036 = 663345^2 + 594506^2 .
It is a cyclic number.
It is not a de Polignac number, because 793463973061 - 227 = 793329755333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 793463972987 and 793463973005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (793463973661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 396731986530 + 396731986531.
It is an arithmetic number, because the mean of its divisors is an integer number (396731986531).
Almost surely, 2793463973061 is an apocalyptic number.
It is an amenable number.
793463973061 is a deficient number, since it is larger than the sum of its proper divisors (1).
793463973061 is an equidigital number, since it uses as much as digits as its factorization.
793463973061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15431472, while the sum is 58.
The spelling of 793463973061 in words is "seven hundred ninety-three billion, four hundred sixty-three million, nine hundred seventy-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •