Base | Representation |
---|---|
bin | 1011111100011000101100… |
… | …1101000010110110111101 |
3 | 1201111102010011202202211112 |
4 | 2333012023031002312331 |
5 | 3210123414410221402 |
6 | 43532440344331405 |
7 | 2523521311211312 |
oct | 277061315026675 |
9 | 51442104682745 |
10 | 13132050476477 |
11 | 42032a9162189 |
12 | 15810b5173b65 |
13 | 7434685cb52a |
14 | 335847968d09 |
15 | 17b8dc52de52 |
hex | bf18b342dbd |
13132050476477 has 4 divisors (see below), whose sum is σ = 13178783752476. Its totient is φ = 13085317200480.
The previous prime is 13132050476437. The next prime is 13132050476483. The reversal of 13132050476477 is 77467405023131.
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 11769743658436 + 1362306818041 = 3430706^2 + 1167179^2 .
It is a cyclic number.
It is not a de Polignac number, because 13132050476477 - 212 = 13132050472381 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 (13132050476437) 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, 23366637578 + ... + 23366638139.
It is an arithmetic number, because the mean of its divisors is an integer number (3294695938119).
Almost surely, 213132050476477 is an apocalyptic number.
It is an amenable number.
13132050476477 is a deficient number, since it is larger than the sum of its proper divisors (46733275999).
13132050476477 is an equidigital number, since it uses as much as digits as its factorization.
13132050476477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46733275998.
The product of its (nonzero) digits is 2963520, while the sum is 50.
The spelling of 13132050476477 in words is "thirteen trillion, one hundred thirty-two billion, fifty million, four hundred seventy-six thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •