Base | Representation |
---|---|
bin | 1011111100011000111000… |
… | …1110010001011100100101 |
3 | 1201111102020201002020102201 |
4 | 2333012032032101130211 |
5 | 3210124020342130041 |
6 | 43532445354134501 |
7 | 2523522464600266 |
oct | 277061616213445 |
9 | 51442221066381 |
10 | 13132101130021 |
11 | 4203324809a15 |
12 | 158110a121431 |
13 | 743475c55243 |
14 | 33585059296d |
15 | 17b8e1bd7631 |
hex | bf18e391725 |
13132101130021 has 8 divisors (see below), whose sum is σ = 13711894189920. Its totient is φ = 12560772202608.
The previous prime is 13132101130019. The next prime is 13132101130073. The reversal of 13132101130021 is 12003110123131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13132101130021 - 21 = 13132101130019 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 (13132101130121) 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, 2116029951 + ... + 2116036156.
It is an arithmetic number, because the mean of its divisors is an integer number (1713986773740).
Almost surely, 213132101130021 is an apocalyptic number.
It is an amenable number.
13132101130021 is a deficient number, since it is larger than the sum of its proper divisors (579793059899).
13132101130021 is a wasteful number, since it uses less digits than its factorization.
13132101130021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4232066243.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13132101130021 its reverse (12003110123131), we get a palindrome (25135211253152).
The spelling of 13132101130021 in words is "thirteen trillion, one hundred thirty-two billion, one hundred one million, one hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •