Base | Representation |
---|---|
bin | 11000010101101101… |
… | …01110110110010000 |
3 | 1020201122220110222010 |
4 | 30022312232312100 |
5 | 203230124143322 |
6 | 10000343342520 |
7 | 641545565133 |
oct | 141266566620 |
9 | 36648813863 |
10 | 13067021712 |
11 | 55a5aa18a8 |
12 | 2648151a40 |
13 | 1303239a14 |
14 | 8bd61421a |
15 | 51729020c |
hex | 30adaed90 |
13067021712 has 60 divisors (see below), whose sum is σ = 35858990096. Its totient is φ = 4099453440.
The previous prime is 13067021711. The next prime is 13067021783. The reversal of 13067021712 is 21712076031.
13067021712 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 13067021712.
It is not an unprimeable number, because it can be changed into a prime (13067021711) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 457114 + ... + 484857.
Almost surely, 213067021712 is an apocalyptic number.
13067021712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13067021712 is an abundant number, since it is smaller than the sum of its proper divisors (22791968384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13067021712 is a wasteful number, since it uses less digits than its factorization.
13067021712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 942016 (or 941993 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 30.
Adding to 13067021712 its reverse (21712076031), we get a palindrome (34779097743).
The spelling of 13067021712 in words is "thirteen billion, sixty-seven million, twenty-one thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •