Base | Representation |
---|---|
bin | 10111101101101101… |
… | …11000000001100010 |
3 | 1012212021120222020210 |
4 | 23312312320001202 |
5 | 202033231434403 |
6 | 5503200314550 |
7 | 630333043320 |
oct | 136666700142 |
9 | 35767528223 |
10 | 12731514978 |
11 | 5443676706 |
12 | 2573912a56 |
13 | 127b889620 |
14 | 88ac3ad10 |
15 | 4e7abab03 |
hex | 2f6db8062 |
12731514978 has 64 divisors (see below), whose sum is σ = 31514434560. Its totient is φ = 3338978112.
The previous prime is 12731514973. The next prime is 12731514979. The reversal of 12731514978 is 87941513721.
12731514978 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 (12731514973) 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 31 ways as a sum of consecutive naturals, for example, 32601 + ... + 162867.
It is an arithmetic number, because the mean of its divisors is an integer number (492413040).
Almost surely, 212731514978 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12731514978, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15757217280).
12731514978 is an abundant number, since it is smaller than the sum of its proper divisors (18782919582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12731514978 is a wasteful number, since it uses less digits than its factorization.
12731514978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130471.
The product of its digits is 423360, while the sum is 48.
The spelling of 12731514978 in words is "twelve billion, seven hundred thirty-one million, five hundred fourteen thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •