Base | Representation |
---|---|
bin | 11000001001111001… |
… | …11010101100011001 |
3 | 1020110202112122000012 |
4 | 30010330322230121 |
5 | 203024300323201 |
6 | 5542444451305 |
7 | 636234003200 |
oct | 140474725431 |
9 | 36422478005 |
10 | 12967979801 |
11 | 55550a5187 |
12 | 261ab49b35 |
13 | 12b887033a |
14 | 8b03d2237 |
15 | 50d7295bb |
hex | 304f3ab19 |
12967979801 has 12 divisors (see below), whose sum is σ = 15124002660. Its totient is φ = 11086820640.
The previous prime is 12967979777. The next prime is 12967979839. The reversal of 12967979801 is 10897976921.
12967979801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4080015625 + 8887964176 = 63875^2 + 94276^2 .
It is not a de Polignac number, because 12967979801 - 230 = 11894237977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12967973801) 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, 321110 + ... + 359231.
It is an arithmetic number, because the mean of its divisors is an integer number (1260333555).
Almost surely, 212967979801 is an apocalyptic number.
It is an amenable number.
12967979801 is a deficient number, since it is larger than the sum of its proper divisors (2156022859).
12967979801 is an equidigital number, since it uses as much as digits as its factorization.
12967979801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680744 (or 680737 counting only the distinct ones).
The product of its (nonzero) digits is 3429216, while the sum is 59.
The spelling of 12967979801 in words is "twelve billion, nine hundred sixty-seven million, nine hundred seventy-nine thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •