Base | Representation |
---|---|
bin | 1001001101110001001000… |
… | …1100001000010010001101 |
3 | 1022212121210202211011221001 |
4 | 2103130102030020102031 |
5 | 2312001102023131223 |
6 | 33314345422140301 |
7 | 2064010462445236 |
oct | 223342214102215 |
9 | 38777722734831 |
10 | 10132133020813 |
11 | 3257016a45271 |
12 | 1177812a21691 |
13 | 5865c0c0cb3b |
14 | 27057d9dc08d |
15 | 1288601929ad |
hex | 9371230848d |
10132133020813 has 2 divisors, whose sum is σ = 10132133020814. Its totient is φ = 10132133020812.
The previous prime is 10132133020781. The next prime is 10132133020847. The reversal of 10132133020813 is 31802033123101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9716518139689 + 415614881124 = 3117133^2 + 644682^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132133020813 - 25 = 10132133020781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10132133020853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066066510406 + 5066066510407.
It is an arithmetic number, because the mean of its divisors is an integer number (5066066510407).
Almost surely, 210132133020813 is an apocalyptic number.
It is an amenable number.
10132133020813 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132133020813 is an equidigital number, since it uses as much as digits as its factorization.
10132133020813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 10132133020813 its reverse (31802033123101), we get a palindrome (41934166143914).
The spelling of 10132133020813 in words is "ten trillion, one hundred thirty-two billion, one hundred thirty-three million, twenty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •