Base | Representation |
---|---|
bin | 1001001101110101000111… |
… | …1110001100100100110101 |
3 | 1022212201120100101100121012 |
4 | 2103131101332030210311 |
5 | 2312010244444011242 |
6 | 33315043530002005 |
7 | 2064046135164326 |
oct | 223352176144465 |
9 | 38781510340535 |
10 | 10133203110197 |
11 | 3257515a90262 |
12 | 1177a71276305 |
13 | 58673181a41b |
14 | 270641b9244d |
15 | 1288c40bb282 |
hex | 93751f8c935 |
10133203110197 has 2 divisors, whose sum is σ = 10133203110198. Its totient is φ = 10133203110196.
The previous prime is 10133203110193. The next prime is 10133203110203. The reversal of 10133203110197 is 79101130233101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5416353217636 + 4716849892561 = 2327306^2 + 2171831^2 .
It is a cyclic number.
It is not a de Polignac number, because 10133203110197 - 22 = 10133203110193 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10133203110193) 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, 5066601555098 + 5066601555099.
It is an arithmetic number, because the mean of its divisors is an integer number (5066601555099).
Almost surely, 210133203110197 is an apocalyptic number.
It is an amenable number.
10133203110197 is a deficient number, since it is larger than the sum of its proper divisors (1).
10133203110197 is an equidigital number, since it uses as much as digits as its factorization.
10133203110197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 32.
Adding to 10133203110197 its reverse (79101130233101), we get a palindrome (89234333343298).
The spelling of 10133203110197 in words is "ten trillion, one hundred thirty-three billion, two hundred three million, one hundred ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •