Base | Representation |
---|---|
bin | 1001001101110000101001… |
… | …1001100101111000101001 |
3 | 1022212121110122220111212002 |
4 | 2103130022121211320221 |
5 | 2312000320044112301 |
6 | 33314324433100345 |
7 | 2064004314556001 |
oct | 223341231457051 |
9 | 38777418814762 |
10 | 10132002332201 |
11 | 3256a5a1a2a52 |
12 | 11777970b76b5 |
13 | 58659cb12ab9 |
14 | 27056a4dd001 |
15 | 12885397a16b |
hex | 9370a665e29 |
10132002332201 has 4 divisors (see below), whose sum is σ = 10176246884100. Its totient is φ = 10087757780304.
The previous prime is 10132002332191. The next prime is 10132002332203. The reversal of 10132002332201 is 10223320023101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4606324675225 + 5525677656976 = 2146235^2 + 2350676^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132002332201 - 210 = 10132002331177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132002332203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22122275606 + ... + 22122276063.
It is an arithmetic number, because the mean of its divisors is an integer number (2544061721025).
Almost surely, 210132002332201 is an apocalyptic number.
It is an amenable number.
10132002332201 is a deficient number, since it is larger than the sum of its proper divisors (44244551899).
10132002332201 is an equidigital number, since it uses as much as digits as its factorization.
10132002332201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44244551898.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10132002332201 its reverse (10223320023101), we get a palindrome (20355322355302).
The spelling of 10132002332201 in words is "ten trillion, one hundred thirty-two billion, two million, three hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •