Base | Representation |
---|---|
bin | 100111000001111… |
… | …0100001100010001 |
3 | 10101021021202002200 |
4 | 1032003310030101 |
5 | 10140230414212 |
6 | 333541433413 |
7 | 44311420011 |
oct | 11603641421 |
9 | 3337252080 |
10 | 1309623057 |
11 | 612280206 |
12 | 30670b869 |
13 | 17b4270b2 |
14 | c5d07c41 |
15 | 79e916dc |
hex | 4e0f4311 |
1309623057 has 12 divisors (see below), whose sum is σ = 1927370484. Its totient is φ = 856608480.
The previous prime is 1309623047. The next prime is 1309623079. The reversal of 1309623057 is 7503269031.
It can be written as a sum of positive squares in 2 ways, for example, as 851705856 + 457917201 = 29184^2 + 21399^2 .
It is not a de Polignac number, because 1309623057 - 24 = 1309623041 is a prime.
It is a super-2 number, since 2×13096230572 = 3430225102852050498, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1309623047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1372294 + ... + 1373247.
It is an arithmetic number, because the mean of its divisors is an integer number (160614207).
Almost surely, 21309623057 is an apocalyptic number.
It is an amenable number.
1309623057 is a deficient number, since it is larger than the sum of its proper divisors (617747427).
1309623057 is a wasteful number, since it uses less digits than its factorization.
1309623057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2745600 (or 2745597 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 36.
The square root of 1309623057 is about 36188.7144977547. The cubic root of 1309623057 is about 1094.0792234415.
The spelling of 1309623057 in words is "one billion, three hundred nine million, six hundred twenty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •