Base | Representation |
---|---|
bin | 1001101111111101000100… |
… | …1000101011011100000101 |
3 | 1101221202210001022120021111 |
4 | 2123333101020223130011 |
5 | 2401111414220213431 |
6 | 34444240500445021 |
7 | 2154312005420404 |
oct | 233772110533405 |
9 | 41852701276244 |
10 | 10719452116741 |
11 | 346310429a955 |
12 | 12516029a9771 |
13 | 5c9abc6211c4 |
14 | 290b77a5b63b |
15 | 138c86ae07b1 |
hex | 9bfd122b705 |
10719452116741 has 2 divisors, whose sum is σ = 10719452116742. Its totient is φ = 10719452116740.
The previous prime is 10719452116733. The next prime is 10719452116777. The reversal of 10719452116741 is 14761125491701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10407585714241 + 311866402500 = 3226079^2 + 558450^2 .
It is a cyclic number.
It is not a de Polignac number, because 10719452116741 - 23 = 10719452116733 is a prime.
It is a super-2 number, since 2×107194521167412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10719452114741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5359726058370 + 5359726058371.
It is an arithmetic number, because the mean of its divisors is an integer number (5359726058371).
Almost surely, 210719452116741 is an apocalyptic number.
It is an amenable number.
10719452116741 is a deficient number, since it is larger than the sum of its proper divisors (1).
10719452116741 is an equidigital number, since it uses as much as digits as its factorization.
10719452116741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 423360, while the sum is 49.
The spelling of 10719452116741 in words is "ten trillion, seven hundred nineteen billion, four hundred fifty-two million, one hundred sixteen thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •