Base | Representation |
---|---|
bin | 100101101100001… |
… | …1000100011101001 |
3 | 10021010201120021001 |
4 | 1023120120203221 |
5 | 10042224330431 |
6 | 325254315001 |
7 | 43224426103 |
oct | 11330304351 |
9 | 3233646231 |
10 | 1264683241 |
11 | 599976268 |
12 | 2b3658a61 |
13 | 172020ca3 |
14 | bdd6a573 |
15 | 76065e61 |
hex | 4b6188e9 |
1264683241 has 4 divisors (see below), whose sum is σ = 1265121792. Its totient is φ = 1264244692.
The previous prime is 1264683239. The next prime is 1264683247. The reversal of 1264683241 is 1423864621.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1423864621 = 4259 ⋅334319.
It is a cyclic number.
It is not a de Polignac number, because 1264683241 - 21 = 1264683239 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1264683241.
It is not an unprimeable number, because it can be changed into a prime (1264683247) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214921 + ... + 220726.
It is an arithmetic number, because the mean of its divisors is an integer number (316280448).
Almost surely, 21264683241 is an apocalyptic number.
It is an amenable number.
1264683241 is a deficient number, since it is larger than the sum of its proper divisors (438551).
1264683241 is an equidigital number, since it uses as much as digits as its factorization.
1264683241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 438550.
The product of its digits is 55296, while the sum is 37.
The square root of 1264683241 is about 35562.3851984087. The cubic root of 1264683241 is about 1081.4188145608.
The spelling of 1264683241 in words is "one billion, two hundred sixty-four million, six hundred eighty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •