Base | Representation |
---|---|
bin | 10111110100110101… |
… | …00111000111110101 |
3 | 1020000102221000201012 |
4 | 23322122213013311 |
5 | 202144022331311 |
6 | 5513132042005 |
7 | 631656346535 |
oct | 137232470765 |
9 | 36012830635 |
10 | 12791214581 |
11 | 5474341922 |
12 | 258b903305 |
13 | 128b05c932 |
14 | 894b3b4c5 |
15 | 4ece5e78b |
hex | 2fa6a71f5 |
12791214581 has 4 divisors (see below), whose sum is σ = 12801556332. Its totient is φ = 12780872832.
The previous prime is 12791214559. The next prime is 12791214593. The reversal of 12791214581 is 18541219721.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18541219721 = 3643 ⋅5089547.
It can be written as a sum of positive squares in 2 ways, for example, as 6063113956 + 6728100625 = 77866^2 + 82025^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12791214581 is a prime.
It is a super-2 number, since 2×127912145812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12791214551) 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, 5169020 + ... + 5171493.
It is an arithmetic number, because the mean of its divisors is an integer number (3200389083).
Almost surely, 212791214581 is an apocalyptic number.
It is an amenable number.
12791214581 is a deficient number, since it is larger than the sum of its proper divisors (10341751).
12791214581 is a wasteful number, since it uses less digits than its factorization.
12791214581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10341750.
The product of its digits is 40320, while the sum is 41.
The spelling of 12791214581 in words is "twelve billion, seven hundred ninety-one million, two hundred fourteen thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •