Base | Representation |
---|---|
bin | 1001000110101110101000… |
… | …0101001010010000011101 |
3 | 1022110001122210221001222102 |
4 | 2101223222011022100131 |
5 | 2303010414430132312 |
6 | 33143025433454445 |
7 | 2052166615426133 |
oct | 221535205122035 |
9 | 38401583831872 |
10 | 10011201020957 |
11 | 320a7a9a91934 |
12 | 11582a2b71425 |
13 | 57808a906a86 |
14 | 26878a9a9753 |
15 | 12563348dec2 |
hex | 91aea14a41d |
10011201020957 has 2 divisors, whose sum is σ = 10011201020958. Its totient is φ = 10011201020956.
The previous prime is 10011201020923. The next prime is 10011201020963. The reversal of 10011201020957 is 75902010211001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5912625064921 + 4098575956036 = 2431589^2 + 2024494^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011201020957 - 26 = 10011201020893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011201025957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005600510478 + 5005600510479.
It is an arithmetic number, because the mean of its divisors is an integer number (5005600510479).
Almost surely, 210011201020957 is an apocalyptic number.
It is an amenable number.
10011201020957 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011201020957 is an equidigital number, since it uses as much as digits as its factorization.
10011201020957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 29.
Adding to 10011201020957 its reverse (75902010211001), we get a palindrome (85913211231958).
The spelling of 10011201020957 in words is "ten trillion, eleven billion, two hundred one million, twenty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •