Base | Representation |
---|---|
bin | 1011111100011000111000… |
… | …1100011101011110111001 |
3 | 1201111102020200012002212120 |
4 | 2333012032030131132321 |
5 | 3210124020231430113 |
6 | 43532445340031453 |
7 | 2523522460551423 |
oct | 277061614353671 |
9 | 51442220162776 |
10 | 13132100655033 |
11 | 4203324515068 |
12 | 1581109b32589 |
13 | 743475b19c99 |
14 | 3358504ab813 |
15 | 17b8e1b41a23 |
hex | bf18e31d7b9 |
13132100655033 has 16 divisors (see below), whose sum is σ = 17607777148416. Its totient is φ = 8705587605120.
The previous prime is 13132100655031. The next prime is 13132100655041. The reversal of 13132100655033 is 33055600123131.
It is a happy number.
It is not a de Polignac number, because 13132100655033 - 21 = 13132100655031 is a prime.
It is a super-2 number, since 2×131321006550332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13132100654985 and 13132100655003.
It is not an unprimeable number, because it can be changed into a prime (13132100655031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5038360 + ... + 7186742.
It is an arithmetic number, because the mean of its divisors is an integer number (1100486071776).
Almost surely, 213132100655033 is an apocalyptic number.
It is an amenable number.
13132100655033 is a deficient number, since it is larger than the sum of its proper divisors (4475676493383).
13132100655033 is a wasteful number, since it uses less digits than its factorization.
13132100655033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2159824.
The product of its (nonzero) digits is 24300, while the sum is 33.
Adding to 13132100655033 its reverse (33055600123131), we get a palindrome (46187700778164).
The spelling of 13132100655033 in words is "thirteen trillion, one hundred thirty-two billion, one hundred million, six hundred fifty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •