Base | Representation |
---|---|
bin | 100101101100001… |
… | …0000000010010101 |
3 | 10021010122210101110 |
4 | 1023120100002111 |
5 | 10042222221331 |
6 | 325253445233 |
7 | 43224222255 |
oct | 11330200225 |
9 | 3233583343 |
10 | 1264648341 |
11 | 599952020 |
12 | 2b3640819 |
13 | 17200b138 |
14 | bdd5b965 |
15 | 7605a946 |
hex | 4b610095 |
1264648341 has 48 divisors (see below), whose sum is σ = 1966325760. Its totient is φ = 716804640.
The previous prime is 1264648291. The next prime is 1264648349. The reversal of 1264648341 is 1438464621.
It is not a de Polignac number, because 1264648341 - 27 = 1264648213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1264648341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1264648349) 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 in 47 ways as a sum of consecutive naturals, for example, 988140 + ... + 989418.
It is an arithmetic number, because the mean of its divisors is an integer number (40965120).
Almost surely, 21264648341 is an apocalyptic number.
1264648341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1264648341 is a deficient number, since it is larger than the sum of its proper divisors (701677419).
1264648341 is a wasteful number, since it uses less digits than its factorization.
1264648341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1414 (or 1395 counting only the distinct ones).
The product of its digits is 110592, while the sum is 39.
The square root of 1264648341 is about 35561.8945080264. The cubic root of 1264648341 is about 1081.4088669148.
The spelling of 1264648341 in words is "one billion, two hundred sixty-four million, six hundred forty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •