Base | Representation |
---|---|
bin | 100111000001001… |
… | …0010111110111101 |
3 | 10101020112111220212 |
4 | 1032002102332331 |
5 | 10140130144033 |
6 | 333525122205 |
7 | 44305141124 |
oct | 11602227675 |
9 | 3336474825 |
10 | 1309224893 |
11 | 612029049 |
12 | 306559365 |
13 | 17b317ab2 |
14 | c5c42abb |
15 | 79e13748 |
hex | 4e092fbd |
1309224893 has 16 divisors (see below), whose sum is σ = 1416372480. Its totient is φ = 1205707776.
The previous prime is 1309224881. The next prime is 1309224901. The reversal of 1309224893 is 3984229031.
It is a cyclic number.
It is not a de Polignac number, because 1309224893 - 218 = 1308962749 is a prime.
It is a super-2 number, since 2×13092248932 = 3428139640901722898, which contains 22 as substring.
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 1309224893.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1309224793) by changing a digit.
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, 147446 + ... + 156072.
It is an arithmetic number, because the mean of its divisors is an integer number (88523280).
Almost surely, 21309224893 is an apocalyptic number.
It is an amenable number.
1309224893 is a deficient number, since it is larger than the sum of its proper divisors (107147587).
1309224893 is a wasteful number, since it uses less digits than its factorization.
1309224893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8836.
The product of its (nonzero) digits is 93312, while the sum is 41.
The square root of 1309224893 is about 36183.2128617678. The cubic root of 1309224893 is about 1093.9683347619.
The spelling of 1309224893 in words is "one billion, three hundred nine million, two hundred twenty-four thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •