Base | Representation |
---|---|
bin | 11000100110011001… |
… | …01111000111100000 |
3 | 1021002102022111122210 |
4 | 30103030233013200 |
5 | 204021443221322 |
6 | 10022304002120 |
7 | 645165466443 |
oct | 142314570740 |
9 | 37072274583 |
10 | 13207007712 |
11 | 5668014408 |
12 | 2687000340 |
13 | 1326240882 |
14 | 8d405365a |
15 | 5246e270c |
hex | 31332f1e0 |
13207007712 has 24 divisors (see below), whose sum is σ = 34668395496. Its totient is φ = 4402335872.
The previous prime is 13207007707. The next prime is 13207007713. The reversal of 13207007712 is 21770070231.
It is a tau number, because it is divible by the number of its divisors (24).
It is a self number, because there is not a number n which added to its sum of digits gives 13207007712.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13207007713) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68786403 + ... + 68786594.
It is an arithmetic number, because the mean of its divisors is an integer number (1444516479).
Almost surely, 213207007712 is an apocalyptic number.
13207007712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13207007712 is an abundant number, since it is smaller than the sum of its proper divisors (21461387784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13207007712 is a wasteful number, since it uses less digits than its factorization.
13207007712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137573010 (or 137573002 counting only the distinct ones).
The product of its (nonzero) digits is 4116, while the sum is 30.
Adding to 13207007712 its reverse (21770070231), we get a palindrome (34977077943).
The spelling of 13207007712 in words is "thirteen billion, two hundred seven million, seven thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •