Base | Representation |
---|---|
bin | 1001000001000010001… |
… | …10110010011110010111 |
3 | 1002121122000022200110021 |
4 | 10200201012302132113 |
5 | 20033424011314142 |
6 | 354152244410011 |
7 | 31244650446613 |
oct | 4404106623627 |
9 | 1077560280407 |
10 | 309793073047 |
11 | 10a423127aa7 |
12 | 500590a6907 |
13 | 232a09a7ba3 |
14 | 10dcb9dc343 |
15 | 80d22e5267 |
hex | 48211b2797 |
309793073047 has 4 divisors (see below), whose sum is σ = 319786398016. Its totient is φ = 299799748080.
The previous prime is 309793073017. The next prime is 309793073087. The reversal of 309793073047 is 740370397903.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 740370397903 = 41 ⋅18057814583.
It is a cyclic number.
It is not a de Polignac number, because 309793073047 - 219 = 309792548759 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 309793072985 and 309793073003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (309793073017) 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 3 ways as a sum of consecutive naturals, for example, 4996662438 + ... + 4996662499.
It is an arithmetic number, because the mean of its divisors is an integer number (79946599504).
Almost surely, 2309793073047 is an apocalyptic number.
309793073047 is a deficient number, since it is larger than the sum of its proper divisors (9993324969).
309793073047 is an equidigital number, since it uses as much as digits as its factorization.
309793073047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9993324968.
The product of its (nonzero) digits is 3000564, while the sum is 52.
The spelling of 309793073047 in words is "three hundred nine billion, seven hundred ninety-three million, seventy-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •