Base | Representation |
---|---|
bin | 1001001101110000110101… |
… | …1100100111001010001111 |
3 | 1022212121121020002211211201 |
4 | 2103130031130213022033 |
5 | 2312000421141034003 |
6 | 33314333500530331 |
7 | 2064005505242350 |
oct | 223341534471217 |
9 | 38777536084751 |
10 | 10132053455503 |
11 | 3256a86040711 |
12 | 11777b02509a7 |
13 | 5865aa5a2585 |
14 | 270573209d27 |
15 | 1288581c7b1d |
hex | 9370d72728f |
10132053455503 has 8 divisors (see below), whose sum is σ = 11627537340320. Its totient is φ = 8648581489920.
The previous prime is 10132053455449. The next prime is 10132053455551. The reversal of 10132053455503 is 30555435023101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10132053455503 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132053455603) 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 in 7 ways as a sum of consecutive naturals, for example, 3002977998 + ... + 3002981371.
It is an arithmetic number, because the mean of its divisors is an integer number (1453442167540).
Almost surely, 210132053455503 is an apocalyptic number.
10132053455503 is a deficient number, since it is larger than the sum of its proper divisors (1495483884817).
10132053455503 is an equidigital number, since it uses as much as digits as its factorization.
10132053455503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6005959617.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 10132053455503 its reverse (30555435023101), we get a palindrome (40687488478604).
The spelling of 10132053455503 in words is "ten trillion, one hundred thirty-two billion, fifty-three million, four hundred fifty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •