Base | Representation |
---|---|
bin | 11010100011000000… |
… | …00111000000010001 |
3 | 1100210021011112000012 |
4 | 31101200013000101 |
5 | 213142040224211 |
6 | 10314123404305 |
7 | 1013120220212 |
oct | 152140070021 |
9 | 40707145005 |
10 | 14252273681 |
11 | 6054045188 |
12 | 2919083695 |
13 | 1461969449 |
14 | 992bc5409 |
15 | 586365d8b |
hex | 351807011 |
14252273681 has 2 divisors, whose sum is σ = 14252273682. Its totient is φ = 14252273680.
The previous prime is 14252273657. The next prime is 14252273683. The reversal of 14252273681 is 18637225241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9488513281 + 4763760400 = 97409^2 + 69020^2 .
It is an emirp because it is prime and its reverse (18637225241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14252273681 - 26 = 14252273617 is a prime.
It is a super-2 number, since 2×142522736812 (a number of 21 digits) contains 22 as substring.
Together with 14252273683, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14252273683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7126136840 + 7126136841.
It is an arithmetic number, because the mean of its divisors is an integer number (7126136841).
Almost surely, 214252273681 is an apocalyptic number.
It is an amenable number.
14252273681 is a deficient number, since it is larger than the sum of its proper divisors (1).
14252273681 is an equidigital number, since it uses as much as digits as its factorization.
14252273681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 161280, while the sum is 41.
The spelling of 14252273681 in words is "fourteen billion, two hundred fifty-two million, two hundred seventy-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •