Base | Representation |
---|---|
bin | 11000000010011110… |
… | …11101100010001111 |
3 | 1020022102102010101221 |
4 | 30001033131202033 |
5 | 202412331412424 |
6 | 5532342344211 |
7 | 634546625341 |
oct | 140117354217 |
9 | 36272363357 |
10 | 12905732239 |
11 | 5522a49714 |
12 | 260212b067 |
13 | 12a89b736a |
14 | 8a602b291 |
15 | 5080309e4 |
hex | 3013dd88f |
12905732239 has 4 divisors (see below), whose sum is σ = 13466851056. Its totient is φ = 12344613424.
The previous prime is 12905732219. The next prime is 12905732243. The reversal of 12905732239 is 93223750921.
12905732239 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.
It is a cyclic number.
It is not a de Polignac number, because 12905732239 - 219 = 12905207951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12905732195 and 12905732204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12905732219) 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, 280559374 + ... + 280559419.
It is an arithmetic number, because the mean of its divisors is an integer number (3366712764).
Almost surely, 212905732239 is an apocalyptic number.
12905732239 is a deficient number, since it is larger than the sum of its proper divisors (561118817).
12905732239 is an equidigital number, since it uses as much as digits as its factorization.
12905732239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561118816.
The product of its (nonzero) digits is 204120, while the sum is 43.
The spelling of 12905732239 in words is "twelve billion, nine hundred five million, seven hundred thirty-two thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •