Base | Representation |
---|---|
bin | 1001001101110100011111… |
… | …0101010010000100101001 |
3 | 1022212201010111021221000002 |
4 | 2103131013311102010221 |
5 | 2312004422422020012 |
6 | 33315015011552345 |
7 | 2064042001243025 |
oct | 223350765220451 |
9 | 38781114257002 |
10 | 10133033001257 |
11 | 3257438a63961 |
12 | 1177a242bb6b5 |
13 | 5867054ca64a |
14 | 270627351385 |
15 | 1288b41b87c2 |
hex | 93747d52129 |
10133033001257 has 2 divisors, whose sum is σ = 10133033001258. Its totient is φ = 10133033001256.
The previous prime is 10133033001251. The next prime is 10133033001263. The reversal of 10133033001257 is 75210033033101.
It is a balanced prime because it is at equal distance from previous prime (10133033001251) and next prime (10133033001263).
It can be written as a sum of positive squares in only one way, i.e., 10110466652416 + 22566348841 = 3179696^2 + 150221^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10133033001257 is a prime.
It is not a weakly prime, because it can be changed into another prime (10133033001251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066516500628 + 5066516500629.
It is an arithmetic number, because the mean of its divisors is an integer number (5066516500629).
Almost surely, 210133033001257 is an apocalyptic number.
It is an amenable number.
10133033001257 is a deficient number, since it is larger than the sum of its proper divisors (1).
10133033001257 is an equidigital number, since it uses as much as digits as its factorization.
10133033001257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 29.
Adding to 10133033001257 its reverse (75210033033101), we get a palindrome (85343066034358).
The spelling of 10133033001257 in words is "ten trillion, one hundred thirty-three billion, thirty-three million, one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •