Base | Representation |
---|---|
bin | 10111101011110010… |
… | …01100110001000100 |
3 | 1012211011011112222020 |
4 | 23311321030301010 |
5 | 202020112101022 |
6 | 5501422003140 |
7 | 630045444354 |
oct | 136571146104 |
9 | 35734145866 |
10 | 12715347012 |
11 | 5435533455 |
12 | 256a4164b0 |
13 | 1278418494 |
14 | 888a2cb64 |
15 | 4e647535c |
hex | 2f5e4cc44 |
12715347012 has 48 divisors (see below), whose sum is σ = 29855347200. Its totient is φ = 4211930880.
The previous prime is 12715346993. The next prime is 12715347019. The reversal of 12715347012 is 21074351721.
12715347012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (12715347019) 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 15 ways as a sum of consecutive naturals, for example, 1315437 + ... + 1325067.
It is an arithmetic number, because the mean of its divisors is an integer number (621986400).
Almost surely, 212715347012 is an apocalyptic number.
12715347012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12715347012 is an abundant number, since it is smaller than the sum of its proper divisors (17140000188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12715347012 is a wasteful number, since it uses less digits than its factorization.
12715347012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10316 (or 10314 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 33.
Adding to 12715347012 its reverse (21074351721), we get a palindrome (33789698733).
The spelling of 12715347012 in words is "twelve billion, seven hundred fifteen million, three hundred forty-seven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •