Base | Representation |
---|---|
bin | 100010110011010010011001… |
… | …0011011010010111011101001 |
3 | 1111010212102000212020020121212 |
4 | 1011212210302123102323221 |
5 | 310110401132311312131 |
6 | 3003015434431442505 |
7 | 121323104042550062 |
oct | 10546446233227351 |
9 | 1433772025206555 |
10 | 306116050104041 |
11 | 895a10a6944771 |
12 | 2a3bb411986435 |
13 | 101a6809521118 |
14 | 558414b13b569 |
15 | 255cbaab22a2b |
hex | 11669326d2ee9 |
306116050104041 has 16 divisors (see below), whose sum is σ = 309288843322368. Its totient is φ = 302947175638800.
The previous prime is 306116050104023. The next prime is 306116050104061. The reversal of 306116050104041 is 140401050611603.
It is a cyclic number.
It is not a de Polignac number, because 306116050104041 - 226 = 306115982995177 is a prime.
It is a super-2 number, since 2×3061160501040412 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 306116050103989 and 306116050104007.
It is not an unprimeable number, because it can be changed into a prime (306116050104061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1116475730 + ... + 1116749876.
It is an arithmetic number, because the mean of its divisors is an integer number (19330552707648).
Almost surely, 2306116050104041 is an apocalyptic number.
It is an amenable number.
306116050104041 is a deficient number, since it is larger than the sum of its proper divisors (3172793218327).
306116050104041 is a wasteful number, since it uses less digits than its factorization.
306116050104041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281252.
The product of its (nonzero) digits is 8640, while the sum is 32.
The spelling of 306116050104041 in words is "three hundred six trillion, one hundred sixteen billion, fifty million, one hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •