Base | Representation |
---|---|
bin | 11001011000111000… |
… | …00000001010111000 |
3 | 1022011221002002201120 |
4 | 30230130000022320 |
5 | 210403343040440 |
6 | 10132311345240 |
7 | 661526554323 |
oct | 145434001270 |
9 | 38157062646 |
10 | 13630440120 |
11 | 5865034450 |
12 | 2784982220 |
13 | 1392b979ab |
14 | 9343977ba |
15 | 54b983dd0 |
hex | 32c7002b8 |
13630440120 has 64 divisors (see below), whose sum is σ = 44608717440. Its totient is φ = 3304348800.
The previous prime is 13630440107. The next prime is 13630440181. The reversal of 13630440120 is 2104403631.
It is a super-2 number, since 2×136304401202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5161726 + ... + 5164365.
It is an arithmetic number, because the mean of its divisors is an integer number (697011210).
Almost surely, 213630440120 is an apocalyptic number.
13630440120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13630440120 is an abundant number, since it is smaller than the sum of its proper divisors (30978277320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13630440120 is a wasteful number, since it uses less digits than its factorization.
13630440120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10326116 (or 10326112 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 13630440120 its reverse (2104403631), we get a palindrome (15734843751).
The spelling of 13630440120 in words is "thirteen billion, six hundred thirty million, four hundred forty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.703 sec. • engine limits •