Base | Representation |
---|---|
bin | 101111010001111011100… |
… | …011010100000001010101 |
3 | 102111121102010220020210002 |
4 | 233101323203110001111 |
5 | 411213042420133024 |
6 | 10524333513541045 |
7 | 453510636301604 |
oct | 57217343240125 |
9 | 12447363806702 |
10 | 3249068130389 |
11 | 1042a16290554 |
12 | 445836414785 |
13 | 1a7502817453 |
14 | b3381a53a3b |
15 | 597b08386ae |
hex | 2f47b8d4055 |
3249068130389 has 2 divisors, whose sum is σ = 3249068130390. Its totient is φ = 3249068130388.
The previous prime is 3249068130361. The next prime is 3249068130467. The reversal of 3249068130389 is 9830318609423.
3249068130389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2846880052900 + 402188077489 = 1687270^2 + 634183^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3249068130389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3249068130689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1624534065194 + 1624534065195.
It is an arithmetic number, because the mean of its divisors is an integer number (1624534065195).
Almost surely, 23249068130389 is an apocalyptic number.
It is an amenable number.
3249068130389 is a deficient number, since it is larger than the sum of its proper divisors (1).
3249068130389 is an equidigital number, since it uses as much as digits as its factorization.
3249068130389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6718464, while the sum is 56.
The spelling of 3249068130389 in words is "three trillion, two hundred forty-nine billion, sixty-eight million, one hundred thirty thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •