Base | Representation |
---|---|
bin | 1100000011111001110011… |
… | …1011100000100111100000 |
3 | 1201221202110121112020221110 |
4 | 3000332130323200213200 |
5 | 3214232412400413134 |
6 | 44112035412223320 |
7 | 2536042551462153 |
oct | 300763473404740 |
9 | 51852417466843 |
10 | 13261196888544 |
11 | 4253050a1a040 |
12 | 15a213800ab40 |
13 | 7526aa6a9937 |
14 | 33bbb9919c9a |
15 | 17ee4a4827e9 |
hex | c0f9cee09e0 |
13261196888544 has 384 divisors, whose sum is σ = 41396045483520. Its totient is φ = 3673960243200.
The previous prime is 13261196888497. The next prime is 13261196888579. The reversal of 13261196888544 is 44588869116231.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
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, 64764694 + ... + 64969130.
It is an arithmetic number, because the mean of its divisors is an integer number (107802201780).
Almost surely, 213261196888544 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 13261196888544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20698022741760).
13261196888544 is an abundant number, since it is smaller than the sum of its proper divisors (28134848594976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13261196888544 is a wasteful number, since it uses less digits than its factorization.
13261196888544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204594 (or 204586 counting only the distinct ones).
The product of its digits is 79626240, while the sum is 66.
The spelling of 13261196888544 in words is "thirteen trillion, two hundred sixty-one billion, one hundred ninety-six million, eight hundred eighty-eight thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •