Base | Representation |
---|---|
bin | 1011110110100100011110… |
… | …0011101110000010011100 |
3 | 1201010212012122020210210220 |
4 | 2331221013203232002130 |
5 | 3202004301104301022 |
6 | 43414513430201340 |
7 | 2513353235340135 |
oct | 275510743560234 |
9 | 51125178223726 |
10 | 13032131322012 |
11 | 4174994425580 |
12 | 156586a4b3250 |
13 | 736c03786caa |
14 | 330a89550c8c |
15 | 178ee046385c |
hex | bda478ee09c |
13032131322012 has 48 divisors (see below), whose sum is σ = 33230189782272. Its totient is φ = 3942286433280.
The previous prime is 13032131321971. The next prime is 13032131322029. The reversal of 13032131322012 is 21022313123031.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 85476928 + ... + 85629255.
It is an arithmetic number, because the mean of its divisors is an integer number (692295620464).
Almost surely, 213032131322012 is an apocalyptic number.
13032131322012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13032131322012 is an abundant number, since it is smaller than the sum of its proper divisors (20198058460260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032131322012 is a wasteful number, since it uses less digits than its factorization.
13032131322012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171106778 (or 171106776 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13032131322012 its reverse (21022313123031), we get a palindrome (34054444445043).
The spelling of 13032131322012 in words is "thirteen trillion, thirty-two billion, one hundred thirty-one million, three hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •