Base | Representation |
---|---|
bin | 1100101100010000010111… |
… | …0110100100011100000000 |
3 | 1211102000212101210112020220 |
4 | 3023010011312210130000 |
5 | 3312112201403421213 |
6 | 45402330122503040 |
7 | 2640114126606201 |
oct | 313040566443400 |
9 | 54360771715226 |
10 | 13954446935808 |
11 | 44a005855a2a5 |
12 | 1694570064a80 |
13 | 7a2b8b59b9b2 |
14 | 3635825935a8 |
15 | 192ec1b63e23 |
hex | cb105da4700 |
13954446935808 has 144 divisors (see below), whose sum is σ = 38068536016896. Its totient is φ = 4535225671680.
The previous prime is 13954446935777. The next prime is 13954446935827. The reversal of 13954446935808 is 80853964445931.
It is a super-2 number, since 2×139544469358082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51094785 + ... + 51367167.
Almost surely, 213954446935808 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 13954446935808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19034268008448).
13954446935808 is an abundant number, since it is smaller than the sum of its proper divisors (24114089081088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13954446935808 is a wasteful number, since it uses less digits than its factorization.
13954446935808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274070 (or 274056 counting only the distinct ones).
The product of its (nonzero) digits is 447897600, while the sum is 69.
The spelling of 13954446935808 in words is "thirteen trillion, nine hundred fifty-four billion, four hundred forty-six million, nine hundred thirty-five thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •