Base | Representation |
---|---|
bin | 1001100000001100100111… |
… | …0000111101101001110101 |
3 | 1100222220001001002121000221 |
4 | 2120003021300331221311 |
5 | 2332143012323112413 |
6 | 34120030514534341 |
7 | 2125616440335223 |
oct | 230031160755165 |
9 | 40886031077027 |
10 | 10448745519733 |
11 | 33693194a1914 |
12 | 12090538973b1 |
13 | 5aa40a678661 |
14 | 281a1718db13 |
15 | 131be0ed368d |
hex | 980c9c3da75 |
10448745519733 has 2 divisors, whose sum is σ = 10448745519734. Its totient is φ = 10448745519732.
The previous prime is 10448745519731. The next prime is 10448745519791. The reversal of 10448745519733 is 33791554784401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7032377370769 + 3416368148964 = 2651863^2 + 1848342^2 .
It is a cyclic number.
It is not a de Polignac number, because 10448745519733 - 21 = 10448745519731 is a prime.
It is a super-2 number, since 2×104487455197332 (a number of 27 digits) contains 22 as substring.
Together with 10448745519731, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10448745519731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5224372759866 + 5224372759867.
It is an arithmetic number, because the mean of its divisors is an integer number (5224372759867).
Almost surely, 210448745519733 is an apocalyptic number.
It is an amenable number.
10448745519733 is a deficient number, since it is larger than the sum of its proper divisors (1).
10448745519733 is an equidigital number, since it uses as much as digits as its factorization.
10448745519733 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50803200, while the sum is 61.
The spelling of 10448745519733 in words is "ten trillion, four hundred forty-eight billion, seven hundred forty-five million, five hundred nineteen thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •