Base | Representation |
---|---|
bin | 1100000000111011100010… |
… | …1000010100010101100000 |
3 | 1201202212122010010200220020 |
4 | 3000032320220110111200 |
5 | 3212413312213341000 |
6 | 44032351332313440 |
7 | 2532254065261434 |
oct | 300167050242540 |
9 | 51685563120806 |
10 | 13210122012000 |
11 | 4233421541371 |
12 | 1594263172880 |
13 | 74a92b0446b4 |
14 | 33953254a9c4 |
15 | 17d95b56aba0 |
hex | c03b8a14560 |
13210122012000 has 96 divisors (see below), whose sum is σ = 43276359750624. Its totient is φ = 3522699200000.
The previous prime is 13210122011987. The next prime is 13210122012023. The reversal of 13210122012000 is 21022101231.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 550409751 + ... + 550433750.
It is an arithmetic number, because the mean of its divisors is an integer number (450795414069).
Almost surely, 213210122012000 is an apocalyptic number.
13210122012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13210122012000 is an abundant number, since it is smaller than the sum of its proper divisors (30066237738624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13210122012000 is a wasteful number, since it uses less digits than its factorization.
13210122012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100843529 (or 1100843511 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 13210122012000 its reverse (21022101231), we get a palindrome (13231144113231).
The spelling of 13210122012000 in words is "thirteen trillion, two hundred ten billion, one hundred twenty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •