Base | Representation |
---|---|
bin | 1100001111101101001001… |
… | …0100011000011111110000 |
3 | 1202200010211020200120221022 |
4 | 3003323102110120133300 |
5 | 3231043140223023430 |
6 | 44345131145115012 |
7 | 2556511245154163 |
oct | 303732224303760 |
9 | 52603736616838 |
10 | 13463956064240 |
11 | 4321039214830 |
12 | 16154a3788a68 |
13 | 768851531246 |
14 | 347932235ada |
15 | 185365c7a4e5 |
hex | c3ed25187f0 |
13463956064240 has 80 divisors (see below), whose sum is σ = 34150147572096. Its totient is φ = 4895889542400.
The previous prime is 13463956064233. The next prime is 13463956064257. The reversal of 13463956064240 is 4246065936431.
13463956064240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×134639560642402 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58883735 + ... + 59111945.
Almost surely, 213463956064240 is an apocalyptic number.
13463956064240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13463956064240 is an abundant number, since it is smaller than the sum of its proper divisors (20686191507856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13463956064240 is a wasteful number, since it uses less digits than its factorization.
13463956064240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 295278 (or 295272 counting only the distinct ones).
The product of its (nonzero) digits is 11197440, while the sum is 53.
The spelling of 13463956064240 in words is "thirteen trillion, four hundred sixty-three billion, nine hundred fifty-six million, sixty-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •