Base | Representation |
---|---|
bin | 1001011100110011001010… |
… | …0110111111111110110111 |
3 | 1100210022101002121121110022 |
4 | 2113030302212333332313 |
5 | 2330213441443121432 |
6 | 34033134455315355 |
7 | 2121452115022214 |
oct | 227146246777667 |
9 | 40708332547408 |
10 | 10390374973367 |
11 | 3346595883454 |
12 | 11b988367bb5b |
13 | 5a4a6769761c |
14 | 27cc7ac9ab0b |
15 | 13042684bb12 |
hex | 973329bffb7 |
10390374973367 has 2 divisors, whose sum is σ = 10390374973368. Its totient is φ = 10390374973366.
The previous prime is 10390374973327. The next prime is 10390374973483. The reversal of 10390374973367 is 76337947309301.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10390374973367 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10390374973327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5195187486683 + 5195187486684.
It is an arithmetic number, because the mean of its divisors is an integer number (5195187486684).
Almost surely, 210390374973367 is an apocalyptic number.
10390374973367 is a deficient number, since it is larger than the sum of its proper divisors (1).
10390374973367 is an equidigital number, since it uses as much as digits as its factorization.
10390374973367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54010152, while the sum is 62.
The spelling of 10390374973367 in words is "ten trillion, three hundred ninety billion, three hundred seventy-four million, nine hundred seventy-three thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •