Base | Representation |
---|---|
bin | 1100101100011110100101… |
… | …1100100101100110000000 |
3 | 1211102101201111210001102210 |
4 | 3023013221130211212000 |
5 | 3312143011411030143 |
6 | 45404201044142120 |
7 | 2640310553456004 |
oct | 313075134454600 |
9 | 54371644701383 |
10 | 13958265330048 |
11 | 44a1737984416 |
12 | 1695256997940 |
13 | 7a33496a6680 |
14 | 363825752704 |
15 | 193146eb5033 |
hex | cb1e9725980 |
13958265330048 has 512 divisors, whose sum is σ = 40964087808000. Its totient is φ = 4185282576384.
The previous prime is 13958265330001. The next prime is 13958265330067. The reversal of 13958265330048 is 84003356285931.
It is a self number, because there is not a number n which added to its sum of digits gives 13958265330048.
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, 11469403936 + ... + 11469405152.
It is an arithmetic number, because the mean of its divisors is an integer number (80007984000).
Almost surely, 213958265330048 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 13958265330048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20482043904000).
13958265330048 is an abundant number, since it is smaller than the sum of its proper divisors (27005822477952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13958265330048 is a wasteful number, since it uses less digits than its factorization.
13958265330048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1682 (or 1670 counting only the distinct ones).
The product of its (nonzero) digits is 18662400, while the sum is 57.
The spelling of 13958265330048 in words is "thirteen trillion, nine hundred fifty-eight billion, two hundred sixty-five million, three hundred thirty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •