Base | Representation |
---|---|
bin | 100111000000101… |
… | …1100001110000101 |
3 | 10101020010010020000 |
4 | 1032001130032011 |
5 | 10140101004311 |
6 | 333520231513 |
7 | 44303215140 |
oct | 11601341605 |
9 | 3336103200 |
10 | 1309000581 |
11 | 611995569 |
12 | 30646b599 |
13 | 17b269975 |
14 | c5bc5057 |
15 | 79dbc056 |
hex | 4e05c385 |
1309000581 has 40 divisors (see below), whose sum is σ = 2246302080. Its totient is φ = 744139872.
The previous prime is 1309000571. The next prime is 1309000597. The reversal of 1309000581 is 1850009031.
It is not a de Polignac number, because 1309000581 - 25 = 1309000549 is a prime.
It is a super-2 number, since 2×13090005812 = 3426965042116675122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1309000571) 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 39 ways as a sum of consecutive naturals, for example, 105840 + ... + 117558.
It is an arithmetic number, because the mean of its divisors is an integer number (56157552).
Almost surely, 21309000581 is an apocalyptic number.
It is an amenable number.
1309000581 is a deficient number, since it is larger than the sum of its proper divisors (937301499).
1309000581 is a wasteful number, since it uses less digits than its factorization.
1309000581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11935 (or 11926 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 1309000581 is about 36180.1130595248. The cubic root of 1309000581 is about 1093.9058539658.
The spelling of 1309000581 in words is "one billion, three hundred nine million, five hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •