Base | Representation |
---|---|
bin | 11000001110101010… |
… | …11011100110001100 |
3 | 1020120112202212011100 |
4 | 30013111123212030 |
5 | 203120014213320 |
6 | 5550433423100 |
7 | 640230560655 |
oct | 140725334614 |
9 | 36515685140 |
10 | 13007960460 |
11 | 5575722250 |
12 | 263040aa90 |
13 | 12c3c2b131 |
14 | 8b583c52c |
15 | 511ec5790 |
hex | 30755b98c |
13007960460 has 72 divisors (see below), whose sum is σ = 43044530256. Its totient is φ = 3153444480.
The previous prime is 13007960453. The next prime is 13007960473. The reversal of 13007960460 is 6406970031.
13007960460 is a `hidden beast` number, since 130 + 0 + 7 + 9 + 60 + 460 = 666.
13007960460 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 23 ways as a sum of consecutive naturals, for example, 3282859 + ... + 3286818.
It is an arithmetic number, because the mean of its divisors is an integer number (597840698).
Almost surely, 213007960460 is an apocalyptic number.
13007960460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13007960460 is an abundant number, since it is smaller than the sum of its proper divisors (30036569796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13007960460 is a wasteful number, since it uses less digits than its factorization.
13007960460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6569703 (or 6569698 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The spelling of 13007960460 in words is "thirteen billion, seven million, nine hundred sixty thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •