Base | Representation |
---|---|
bin | 1100011001011000001000… |
… | …1110011010100011111100 |
3 | 1210021000201020000021211120 |
4 | 3012112002032122203330 |
5 | 3241303434202001400 |
6 | 44553331110150540 |
7 | 2604512660544120 |
oct | 306260216324374 |
9 | 53230636007746 |
10 | 13630116047100 |
11 | 4385555199213 |
12 | 1641736352450 |
13 | 77b411a4c627 |
14 | 3519b5cc1580 |
15 | 18983d402ca0 |
hex | c658239a8fc |
13630116047100 has 72 divisors (see below), whose sum is σ = 45070250402688. Its totient is φ = 3115455096000.
The previous prime is 13630116047099. The next prime is 13630116047101. The reversal of 13630116047100 is 174061103631.
It is an interprime number because it is at equal distance from previous prime (13630116047099) and next prime (13630116047101).
It is a super-3 number, since 3×136301160471003 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13630116047101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3245263626 + ... + 3245267825.
Almost surely, 213630116047100 is an apocalyptic number.
13630116047100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13630116047100 is an abundant number, since it is smaller than the sum of its proper divisors (31440134355588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13630116047100 is a wasteful number, since it uses less digits than its factorization.
13630116047100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6490531475 (or 6490531468 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The spelling of 13630116047100 in words is "thirteen trillion, six hundred thirty billion, one hundred sixteen million, forty-seven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •