Base | Representation |
---|---|
bin | 1000111111110011000… |
… | …01010010011001100001 |
3 | 1002112220201121202201110 |
4 | 10133321201102121201 |
5 | 20031044001242123 |
6 | 354002321453533 |
7 | 31222334362305 |
oct | 4377141223141 |
9 | 1075821552643 |
10 | 309128930913 |
11 | 10a11224a200 |
12 | 4bab27a12a9 |
13 | 231c6211b8a |
14 | 10d67719d05 |
15 | 8093d57493 |
hex | 47f9852661 |
309128930913 has 48 divisors (see below), whose sum is σ = 457196969600. Its totient is φ = 185641632000.
The previous prime is 309128930911. The next prime is 309128930987. The reversal of 309128930913 is 319039821903.
It is not a de Polignac number, because 309128930913 - 21 = 309128930911 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (309128930911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22411623 + ... + 22425411.
Almost surely, 2309128930913 is an apocalyptic number.
309128930913 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
309128930913 is a deficient number, since it is larger than the sum of its proper divisors (148068038687).
309128930913 is a wasteful number, since it uses less digits than its factorization.
309128930913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14374 (or 14363 counting only the distinct ones).
The product of its (nonzero) digits is 314928, while the sum is 48.
The spelling of 309128930913 in words is "three hundred nine billion, one hundred twenty-eight million, nine hundred thirty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •