Base | Representation |
---|---|
bin | 1100000010111111111100… |
… | …0110100000111010100100 |
3 | 1201220021101002210101110002 |
4 | 3000233333012200322210 |
5 | 3214004110000240312 |
6 | 44100550222120432 |
7 | 2534652621634610 |
oct | 300577706407244 |
9 | 51807332711402 |
10 | 13245664071332 |
11 | 4247500066620 |
12 | 159b122120118 |
13 | 7510a3658434 |
14 | 33b144a3a340 |
15 | 17e83b9c14c2 |
hex | c0bff1a0ea4 |
13245664071332 has 192 divisors, whose sum is σ = 31567387557888. Its totient is φ = 4709749968000.
The previous prime is 13245664071307. The next prime is 13245664071373. The reversal of 13245664071332 is 23317046654231.
13245664071332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15167123 + ... + 16016645.
It is an arithmetic number, because the mean of its divisors is an integer number (164413476864).
Almost surely, 213245664071332 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13245664071332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15783693778944).
13245664071332 is an abundant number, since it is smaller than the sum of its proper divisors (18321723486556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13245664071332 is a wasteful number, since it uses less digits than its factorization.
13245664071332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 849670 (or 849668 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 47.
The spelling of 13245664071332 in words is "thirteen trillion, two hundred forty-five billion, six hundred sixty-four million, seventy-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •