Base | Representation |
---|---|
bin | 1100001100000010110001… |
… | …1000011010111001100100 |
3 | 1202110010102200211120101011 |
4 | 3003000230120122321210 |
5 | 3224030313344001120 |
6 | 44300204242312004 |
7 | 2552123220213604 |
oct | 303005430327144 |
9 | 52403380746334 |
10 | 13401042562660 |
11 | 42a7394186925 |
12 | 1605266058604 |
13 | 7629362b6a2c |
14 | 344884854c04 |
15 | 1838d286cc5a |
hex | c302c61ae64 |
13401042562660 has 96 divisors (see below), whose sum is σ = 29258262633600. Its totient is φ = 5152386032640.
The previous prime is 13401042562657. The next prime is 13401042562673. The reversal of 13401042562660 is 6626524010431.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15735046 + ... + 16564834.
It is an arithmetic number, because the mean of its divisors is an integer number (304773569100).
Almost surely, 213401042562660 is an apocalyptic number.
13401042562660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13401042562660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14629131316800).
13401042562660 is an abundant number, since it is smaller than the sum of its proper divisors (15857220070940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13401042562660 is a wasteful number, since it uses less digits than its factorization.
13401042562660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830141 (or 830139 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 13401042562660 in words is "thirteen trillion, four hundred one billion, forty-two million, five hundred sixty-two thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •