Base | Representation |
---|---|
bin | 100101111100110… |
… | …0111010011010001 |
3 | 10021202010010201000 |
4 | 1023321213103101 |
5 | 10101442110020 |
6 | 330205132213 |
7 | 43361450034 |
oct | 11371472321 |
9 | 3252103630 |
10 | 1273394385 |
11 | 5a388605a |
12 | 2b655a069 |
13 | 173a81003 |
14 | c119701b |
15 | 76bd7090 |
hex | 4be674d1 |
1273394385 has 16 divisors (see below), whose sum is σ = 2263812480. Its totient is φ = 679143600.
The previous prime is 1273394371. The next prime is 1273394393. The reversal of 1273394385 is 5834933721.
It is a de Polignac number, because none of the positive numbers 2k-1273394385 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 1273394385.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 4716141 + ... + 4716410.
It is an arithmetic number, because the mean of its divisors is an integer number (141488280).
Almost surely, 21273394385 is an apocalyptic number.
1273394385 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1273394385 is a deficient number, since it is larger than the sum of its proper divisors (990418095).
1273394385 is an equidigital number, since it uses as much as digits as its factorization.
1273394385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9432565 (or 9432559 counting only the distinct ones).
The product of its digits is 544320, while the sum is 45.
The square root of 1273394385 is about 35684.6519529055. The cubic root of 1273394385 is about 1083.8960747057.
The spelling of 1273394385 in words is "one billion, two hundred seventy-three million, three hundred ninety-four thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •