Base | Representation |
---|---|
bin | 11010100011110000… |
… | …00000101011111101 |
3 | 1100210200221211202201 |
4 | 31101320000223331 |
5 | 213200141224021 |
6 | 10314505551501 |
7 | 1013224404211 |
oct | 152170005375 |
9 | 40720854681 |
10 | 14258539261 |
11 | 605763464a |
12 | 291b1a5591 |
13 | 14630512a5 |
14 | 993976941 |
15 | 586ba2591 |
hex | 351e00afd |
14258539261 has 2 divisors, whose sum is σ = 14258539262. Its totient is φ = 14258539260.
The previous prime is 14258539237. The next prime is 14258539277. The reversal of 14258539261 is 16293585241.
14258539261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8373348036 + 5885191225 = 91506^2 + 76715^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14258539261 is a prime.
It is a super-2 number, since 2×142585392612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14258539861) 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 as a sum of consecutive naturals, namely, 7129269630 + 7129269631.
It is an arithmetic number, because the mean of its divisors is an integer number (7129269631).
Almost surely, 214258539261 is an apocalyptic number.
It is an amenable number.
14258539261 is a deficient number, since it is larger than the sum of its proper divisors (1).
14258539261 is an equidigital number, since it uses as much as digits as its factorization.
14258539261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 518400, while the sum is 46.
The spelling of 14258539261 in words is "fourteen billion, two hundred fifty-eight million, five hundred thirty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •