Base | Representation |
---|---|
bin | 10111001110010001… |
… | …00010011110100101 |
3 | 1012011220012021122220 |
4 | 23213020202132211 |
5 | 201013213203421 |
6 | 5421054142553 |
7 | 620650533225 |
oct | 134710423645 |
9 | 35156167586 |
10 | 12467709861 |
11 | 5318773a52 |
12 | 24bb4b1a59 |
13 | 1239022419 |
14 | 863baa085 |
15 | 4ce85b3c6 |
hex | 2e72227a5 |
12467709861 has 4 divisors (see below), whose sum is σ = 16623613152. Its totient is φ = 8311806572.
The previous prime is 12467709857. The next prime is 12467709893. The reversal of 12467709861 is 16890776421.
12467709861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12467709861 - 22 = 12467709857 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12467709811) 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 3 ways as a sum of consecutive naturals, for example, 2077951641 + ... + 2077951646.
It is an arithmetic number, because the mean of its divisors is an integer number (4155903288).
Almost surely, 212467709861 is an apocalyptic number.
It is an amenable number.
12467709861 is a deficient number, since it is larger than the sum of its proper divisors (4155903291).
12467709861 is an equidigital number, since it uses as much as digits as its factorization.
12467709861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4155903290.
The product of its (nonzero) digits is 1016064, while the sum is 51.
The spelling of 12467709861 in words is "twelve billion, four hundred sixty-seven million, seven hundred nine thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •