Base | Representation |
---|---|
bin | 11000011100100001… |
… | …01010111111101000 |
3 | 1020212122102001210121 |
4 | 30032100222333220 |
5 | 203334240401240 |
6 | 10010144053024 |
7 | 643141314445 |
oct | 141620527750 |
9 | 36778361717 |
10 | 13124153320 |
11 | 5625273703 |
12 | 2663304174 |
13 | 13120211c5 |
14 | 8c70469cc |
15 | 51c2c804a |
hex | 30e42afe8 |
13124153320 has 16 divisors (see below), whose sum is σ = 29529345060. Its totient is φ = 5249661312.
The previous prime is 13124153297. The next prime is 13124153363. The reversal of 13124153320 is 2335142131.
It is a happy number.
13124153320 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 11000233924 + 2123919396 = 104882^2 + 46086^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 164051877 + ... + 164051956.
Almost surely, 213124153320 is an apocalyptic number.
13124153320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13124153320 is an abundant number, since it is smaller than the sum of its proper divisors (16405191740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13124153320 is a wasteful number, since it uses less digits than its factorization.
13124153320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328103844 (or 328103840 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 13124153320 its reverse (2335142131), we get a palindrome (15459295451).
The spelling of 13124153320 in words is "thirteen billion, one hundred twenty-four million, one hundred fifty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •