Base | Representation |
---|---|
bin | 11000101111011010… |
… | …10000001100000000 |
3 | 1021021200122001112100 |
4 | 30113231100030000 |
5 | 204200324000030 |
6 | 10034005030400 |
7 | 650104403553 |
oct | 142755201400 |
9 | 37250561470 |
10 | 13282640640 |
11 | 56a6782565 |
12 | 26a83b5400 |
13 | 1338b02299 |
14 | 90010069a |
15 | 52b182360 |
hex | 317b50300 |
13282640640 has 108 divisors (see below), whose sum is σ = 45956592864. Its totient is φ = 3542034432.
The previous prime is 13282640629. The next prime is 13282640671. The reversal of 13282640640 is 4604628231.
13282640640 is a `hidden beast` number, since 1 + 3 + 2 + 8 + 2 + 6 + 4 + 0 + 640 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 13282640595 and 13282640604.
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 11 ways as a sum of consecutive naturals, for example, 564984 + ... + 588023.
It is an arithmetic number, because the mean of its divisors is an integer number (425524008).
Almost surely, 213282640640 is an apocalyptic number.
13282640640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13282640640 is an abundant number, since it is smaller than the sum of its proper divisors (32673952224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13282640640 is a wasteful number, since it uses less digits than its factorization.
13282640640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1153034 (or 1153017 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The spelling of 13282640640 in words is "thirteen billion, two hundred eighty-two million, six hundred forty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •