Base | Representation |
---|---|
bin | 1100011010001010100100… |
… | …1010000011000100101110 |
3 | 1210022022122201021102120010 |
4 | 3012202221022003010232 |
5 | 3242014200423200010 |
6 | 45003450322034050 |
7 | 2605502316330510 |
oct | 306425112030456 |
9 | 53268581242503 |
10 | 13643654115630 |
11 | 4390272071500 |
12 | 16442941a8926 |
13 | 77c78b744a76 |
14 | 3524dbcb1bb0 |
15 | 189d81bdc620 |
hex | c68a928312e |
13643654115630 has 96 divisors (see below), whose sum is σ = 41133925873152. Its totient is φ = 2835045005760.
The previous prime is 13643654115523. The next prime is 13643654115739. The reversal of 13643654115630 is 3651145634631.
It is a super-2 number, since 2×136436541156302 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13643654115630.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 268444762 + ... + 268495581.
It is an arithmetic number, because the mean of its divisors is an integer number (428478394512).
Almost surely, 213643654115630 is an apocalyptic number.
13643654115630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13643654115630 is an abundant number, since it is smaller than the sum of its proper divisors (27490271757522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13643654115630 is a wasteful number, since it uses less digits than its factorization.
13643654115630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 536940382 (or 536940371 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 48.
The spelling of 13643654115630 in words is "thirteen trillion, six hundred forty-three billion, six hundred fifty-four million, one hundred fifteen thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •