Base | Representation |
---|---|
bin | 1011111100011001101101… |
… | …1100101110100010101110 |
3 | 1201111102211011121120102000 |
4 | 2333012123130232202232 |
5 | 3210124444143214042 |
6 | 43532523402113130 |
7 | 2523531130626540 |
oct | 277063334564256 |
9 | 51442734546360 |
10 | 13132323023022 |
11 | 4203428a95465 |
12 | 15811704ab7a6 |
13 | 7434acc06488 |
14 | 335871c33690 |
15 | 17b90641874c |
hex | bf19b72e8ae |
13132323023022 has 32 divisors (see below), whose sum is σ = 33351931488000. Its totient is φ = 3752092292184.
The previous prime is 13132323022943. The next prime is 13132323023023. The reversal of 13132323023022 is 22032032323131.
13132323023022 is a `hidden beast` number, since 1 + 3 + 1 + 32 + 323 + 0 + 2 + 302 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13132323023023) 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, 17370797272 + ... + 17370798027.
It is an arithmetic number, because the mean of its divisors is an integer number (1042247859000).
Almost surely, 213132323023022 is an apocalyptic number.
13132323023022 is an abundant number, since it is smaller than the sum of its proper divisors (20219608464978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13132323023022 is a wasteful number, since it uses less digits than its factorization.
13132323023022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34741595317 (or 34741595311 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 13132323023022 its reverse (22032032323131), we get a palindrome (35164355346153).
The spelling of 13132323023022 in words is "thirteen trillion, one hundred thirty-two billion, three hundred twenty-three million, twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •