Base | Representation |
---|---|
bin | 11000001010010110… |
… | …10111001111010010 |
3 | 1020111000200000201010 |
4 | 30011023113033102 |
5 | 203031233013423 |
6 | 5543101551350 |
7 | 636311124630 |
oct | 140513271722 |
9 | 36430600633 |
10 | 12971766738 |
11 | 5557251387 |
12 | 2620275556 |
13 | 12b9597c28 |
14 | 8b0ada350 |
15 | 50dc26693 |
hex | 3052d73d2 |
12971766738 has 64 divisors (see below), whose sum is σ = 30006966528. Its totient is φ = 3661701120.
The previous prime is 12971766737. The next prime is 12971766779. The reversal of 12971766738 is 83766717921.
It is a happy number.
12971766738 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 (12971766737) 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, 2690506 + ... + 2695322.
It is an arithmetic number, because the mean of its divisors is an integer number (468858852).
Almost surely, 212971766738 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12971766738, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15003483264).
12971766738 is an abundant number, since it is smaller than the sum of its proper divisors (17035199790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12971766738 is a wasteful number, since it uses less digits than its factorization.
12971766738 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5587.
The product of its digits is 5334336, while the sum is 57.
The spelling of 12971766738 in words is "twelve billion, nine hundred seventy-one million, seven hundred sixty-six thousand, seven hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.279 sec. • engine limits •