Base | Representation |
---|---|
bin | 11000100111001001… |
… | …00000111100100000 |
3 | 1021002212001012021202 |
4 | 30103210200330200 |
5 | 204030042203440 |
6 | 10023045340332 |
7 | 645302460602 |
oct | 142344407440 |
9 | 37085035252 |
10 | 13213241120 |
11 | 5670591692 |
12 | 26891076a8 |
13 | 1327613b91 |
14 | 8d4bd7172 |
15 | 525024615 |
hex | 313920f20 |
13213241120 has 48 divisors (see below), whose sum is σ = 31236746688. Its totient is φ = 5281831680.
The previous prime is 13213241113. The next prime is 13213241131. The reversal of 13213241120 is 2114231231.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 13213241092 and 13213241101.
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 7 ways as a sum of consecutive naturals, for example, 225077 + ... + 277643.
It is an arithmetic number, because the mean of its divisors is an integer number (650765556).
Almost surely, 213213241120 is an apocalyptic number.
13213241120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13213241120 is an abundant number, since it is smaller than the sum of its proper divisors (18023505568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213241120 is a wasteful number, since it uses less digits than its factorization.
13213241120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54153 (or 54145 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 13213241120 its reverse (2114231231), we get a palindrome (15327472351).
The spelling of 13213241120 in words is "thirteen billion, two hundred thirteen million, two hundred forty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •