Base | Representation |
---|---|
bin | 1011110111111010100100… |
… | …0001110010101011100010 |
3 | 1201020001212020000000121020 |
4 | 2331332221001302223202 |
5 | 3202344113301304103 |
6 | 43433254540110310 |
7 | 2515132024126350 |
oct | 275765101625342 |
9 | 51201766000536 |
10 | 13055241431778 |
11 | 4183773491047 |
12 | 156a239b35396 |
13 | 7391475b9460 |
14 | 331c3c9027d0 |
15 | 1798e4273753 |
hex | bdfa9072ae2 |
13055241431778 has 128 divisors (see below), whose sum is σ = 33567904161792. Its totient is φ = 3290029940736.
The previous prime is 13055241431773. The next prime is 13055241431849. The reversal of 13055241431778 is 87713414255031.
It is a self number, because there is not a number n which added to its sum of digits gives 13055241431778.
It is not an unprimeable number, because it can be changed into a prime (13055241431773) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11606050 + ... + 12681122.
It is an arithmetic number, because the mean of its divisors is an integer number (262249251264).
Almost surely, 213055241431778 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13055241431778, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16783952080896).
13055241431778 is an abundant number, since it is smaller than the sum of its proper divisors (20512662730014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13055241431778 is a wasteful number, since it uses less digits than its factorization.
13055241431778 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1076088.
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 13055241431778 in words is "thirteen trillion, fifty-five billion, two hundred forty-one million, four hundred thirty-one thousand, seven hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •