Base | Representation |
---|---|
bin | 11001001010110101… |
… | …11011010101001000 |
3 | 1021212201120011211201 |
4 | 30211122323111020 |
5 | 210133223431030 |
6 | 10112504233544 |
7 | 655600130152 |
oct | 144532732510 |
9 | 37781504751 |
10 | 13512717640 |
11 | 5804638844 |
12 | 275146b8b4 |
13 | 137468a616 |
14 | 9228b1ad2 |
15 | 54147d2ca |
hex | 3256bb548 |
13512717640 has 16 divisors (see below), whose sum is σ = 30403614780. Its totient is φ = 5405087040.
The previous prime is 13512717613. The next prime is 13512717671. The reversal of 13512717640 is 4671721531.
13512717640 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 13132701604 + 380016036 = 114598^2 + 19494^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 13512717640.
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, 168908931 + ... + 168909010.
Almost surely, 213512717640 is an apocalyptic number.
13512717640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13512717640 is an abundant number, since it is smaller than the sum of its proper divisors (16890897140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13512717640 is a wasteful number, since it uses less digits than its factorization.
13512717640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337817952 (or 337817948 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 37.
The spelling of 13512717640 in words is "thirteen billion, five hundred twelve million, seven hundred seventeen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •