Base | Representation |
---|---|
bin | 1001100010111110000000… |
… | …0110010010100101000001 |
3 | 1101011102221201021012000012 |
4 | 2120233200012102211001 |
5 | 2333433023400140343 |
6 | 34153544034234305 |
7 | 2132223464062316 |
oct | 230574006224501 |
9 | 41142851235005 |
10 | 10496364849473 |
11 | 3387535355088 |
12 | 1216323425995 |
13 | 5b1a59139a49 |
14 | 284053652d0d |
15 | 13307b86e718 |
hex | 98be0192941 |
10496364849473 has 2 divisors, whose sum is σ = 10496364849474. Its totient is φ = 10496364849472.
The previous prime is 10496364849431. The next prime is 10496364849533. The reversal of 10496364849473 is 37494846369401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9490299680689 + 1006065168784 = 3080633^2 + 1003028^2 .
It is a cyclic number.
It is not a de Polignac number, because 10496364849473 - 240 = 9396853221697 is a prime.
It is a super-2 number, since 2×104963648494732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10496364849073) 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, 5248182424736 + 5248182424737.
It is an arithmetic number, because the mean of its divisors is an integer number (5248182424737).
Almost surely, 210496364849473 is an apocalyptic number.
It is an amenable number.
10496364849473 is a deficient number, since it is larger than the sum of its proper divisors (1).
10496364849473 is an equidigital number, since it uses as much as digits as its factorization.
10496364849473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 376233984, while the sum is 68.
The spelling of 10496364849473 in words is "ten trillion, four hundred ninety-six billion, three hundred sixty-four million, eight hundred forty-nine thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •