Base | Representation |
---|---|
bin | 1001100010111111111000… |
… | …1000101011001111110001 |
3 | 1101011111020211112002012121 |
4 | 2120233332020223033301 |
5 | 2333440041402310111 |
6 | 34154110035354241 |
7 | 2132242123364365 |
oct | 230577610531761 |
9 | 41144224462177 |
10 | 10496868791281 |
11 | 3387773864014 |
12 | 1216444152981 |
13 | 5b1b09672072 |
14 | 2840a05532a5 |
15 | 1330aac15871 |
hex | 98bfe22b3f1 |
10496868791281 has 2 divisors, whose sum is σ = 10496868791282. Its totient is φ = 10496868791280.
The previous prime is 10496868791267. The next prime is 10496868791369. The reversal of 10496868791281 is 18219786869401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5830491158881 + 4666377632400 = 2414641^2 + 2160180^2 .
It is a cyclic number.
It is not a de Polignac number, because 10496868791281 - 25 = 10496868791249 is a prime.
It is a super-2 number, since 2×104968687912812 (a number of 27 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 10496868791281.
It is not a weakly prime, because it can be changed into another prime (10496868791221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5248434395640 + 5248434395641.
It is an arithmetic number, because the mean of its divisors is an integer number (5248434395641).
Almost surely, 210496868791281 is an apocalyptic number.
It is an amenable number.
10496868791281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10496868791281 is an equidigital number, since it uses as much as digits as its factorization.
10496868791281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 83607552, while the sum is 70.
The spelling of 10496868791281 in words is "ten trillion, four hundred ninety-six billion, eight hundred sixty-eight million, seven hundred ninety-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •