Base | Representation |
---|---|
bin | 1001001101110001011001… |
… | …0011011000111111001111 |
3 | 1022212121222120200100222210 |
4 | 2103130112103120333033 |
5 | 2312001222210024403 |
6 | 33314400325241503 |
7 | 2064012261156243 |
oct | 223342623307717 |
9 | 38777876610883 |
10 | 10132202033103 |
11 | 32570519a1217 |
12 | 1177831b63293 |
13 | 5866022c3c07 |
14 | 270588c44423 |
15 | 128866275b03 |
hex | 937164d8fcf |
10132202033103 has 8 divisors (see below), whose sum is σ = 13823779518208. Its totient is φ = 6597712951704.
The previous prime is 10132202033089. The next prime is 10132202033113. The reversal of 10132202033103 is 30133020223101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10132202033103 - 28 = 10132202032847 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10132202033103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132202033113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39272100775 + ... + 39272101032.
It is an arithmetic number, because the mean of its divisors is an integer number (1727972439776).
Almost surely, 210132202033103 is an apocalyptic number.
10132202033103 is a deficient number, since it is larger than the sum of its proper divisors (3691577485105).
10132202033103 is an equidigital number, since it uses as much as digits as its factorization.
10132202033103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78544201853.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10132202033103 its reverse (30133020223101), we get a palindrome (40265222256204).
The spelling of 10132202033103 in words is "ten trillion, one hundred thirty-two billion, two hundred two million, thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •